Alexander Okhotin

alexander.okhotin@utu.fi

6 of 7

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