Alexander Okhotin

- Docent,
Department of Mathematics and Statistics (Faculty of Science)

alexander.okhotin@utu.fi

3 of 4

Parsing Boolean grammars over a one-letter alphabet using online convolution (2012)
- Theoretical Computer Science
Okhotin A, Reitwiessner C
Representing Hyper-arithmetical Sets by Equations over Sets of Integers (2012)
- Theory of Computing Systems
Jez A, Okhotin A
Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints (2012)
- Lecture Notes in Computer Science
Baader F, Okhotin A
State complexity of operations on two-way finite automata over a unary alphabet (2012)
- Theoretical Computer Science
Kunc M, Okhotin A
Unambiguous finite automata over a unary alphabet (2012)
- Information and Computation
Okhotin A
A simple P-complete problem and its language-theoretic representations (2011)
- Theoretical Computer Science
Okhotin A
Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (2011)
- Lecture Notes in Computer Science
SOFSEM 2011:Theory and Practice of Computer Science Okhotin A
Complexity of Equations over Sets of Natural Numbers (2011)
- Theory of Computing Systems
Jez A, Okhotin A
Describing periodicity in two-way deterministic finite automata using transformation semigroups (2011)
- Lecture Notes in Computer Science
Developments in in Language Theory (DLT 2011) Kunc Michal, Okhotin Alexander
Descriptional Complexity of Unambiguous Nested Word Automata (2011)
- Lecture Notes in Computer Science
Language and Automata Theory and Applications (LATA 2011) Okhotin A, Salomaa K
Expressive power of LL(k) Boolean grammars (2011)
- Theoretical Computer Science
Okhotin A
One-Nonterminal Conjunctive Grammars over a Unary Alphabet (2011)
- Theory of Computing Systems
Jez A, Okhotin A
ON EQUATIONS OVER SETS OF NUMBERS AND THEIR LIMITATIONS (2011)
- International Journal of Foundations of Computer Science
Lehtinen T, Okhotin A
On the State Complexity of Star of Union and Star of Intersection (2011)
- Fundamenta Informaticae
Jiraskova G, Okhotin A
State Complexity of Operations on Input-Driven Pushdown Automata (2011)
- Lecture Notes in Computer Science
Okhotin A, Salomaa K
State complexity of operations on two-way deterministic finite automata over a unary alphabet (2011)
- Lecture Notes in Computer Science
Descriptional Complexity of Formal Systems (DCFS 2011) Kunc Michal, Okhotin Alexander
State Complexity of Union and Intersection for Two-Way Nondeterministic Finite Automata (2011)
- Fundamenta Informaticae
Kunc M, Okhotin A
BOOLEAN GRAMMARS AND GSM MAPPINGS (2010)
- International Journal of Foundations of Computer Science
Lehtinen Tommi, Okhotin Alexander
Computational power of two stacks with restricted communication (2010)
- Information and Computation
Karhumaki Juhani, Kunc Michal, Okhotin Alexander
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth (2010)
- Theory of Computing Systems
Jeż Arthur, Okhotin Alexander