Alexander Okhotin

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

alexander.okhotin@utu.fi

2 of 4

On the determinization blowup for finite automata recognizing equal-length languages (2014) Computing with New Resources Juhani Karhumäki, Alexander Okhotin
Parsing by matrix multiplication generalized to Boolean grammars (2014)
- Theoretical Computer Science
Alexander Okhotin
Transforming two-way alternating finite automata to one-way nondeterministic automata (2014)
- Lecture Notes in Computer Science
Viliam Geffert, Alexander Okhotin
Conjunctive and Boolean grammars: the true general case of the context-free grammars (2013)
- Computer Science Review
Alexander Okhotin
HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES (2013)
- International Journal of Foundations of Computer Science
LEHTINEN T, OKHOTIN A
Homomorphisms preserving deterministic context-free languages (2013)
- International Journal of Foundations of Computer Science
Tommi Lehtinen, Alexander Okhotin
Improved normal form for grammars with one-sided contexts (2013)
- Lecture Notes in Computer Science
Descriptional Complexity of Formal Systems Alexander Okhotin
Input-driven pushdown automata: nondeterminism and unambiguity (2013) Fifth Worskshop on Non-Classical Models of Automata and Applications (NCMA 2013) Alexander Okhotin, Kai Salomaa
One-way simulation of two-way finite automata over small alphabets (2013) Fifth Worskshop on Non-Classical Models of Automata and Applications (NCMA 2013) Viliam Geffert, Alexander Okhotin
On language equations with one-sided concatenation (2013)
- Fundamenta Informaticae
Franz Baader, Alexander Okhotin
Reversibility of computations in graph-walking automata (2013)
- Lecture Notes in Computer Science
Mathematical Foundations of Computer Science Michal Kunc, Alexander Okhotin
Unambiguous conjunctive grammars over a one-letter alphabet (2013) Developments in Language Theory Artur Jez, Alexander Okhotin
Defining contexts in context-free grammars (2012)
- Lecture Notes in Computer Science
Language and Automata Theory and Applications; 6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012, Proceedings M Barash, A Okhotin
Descriptional complexity of input-driven pushdown automata (2012)
- Lecture Notes in Computer Science
Languages Alive: Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday A Okhotin, X Piao, K Salomaa
Homomorphisms preserving deterministic context-free languages (2012)
- Lecture Notes in Computer Science
Developments in Language Theory; 16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012, Proceedings T Lehtinen, A Okhotin
Language equations with complementation: Expressive power (2012)
- Theoretical Computer Science
Okhotin A, Yakimova O
Language Equations with Symmetric Difference (2012)
- Fundamenta Informaticae
Okhotin A
Non-erasing variants of the Chomsky--Schützenberger theorem (2012)
- Lecture Notes in Computer Science
Developments in Language Theory; 16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012, Proceedings A Okhotin
On the expressive power of univariate equations over sets of natural numbers (2012)
- Information and Computation
Okhotin A, Rondogiannis P
On the number of nonterminal symbols in unambiguous conjunctive grammars (2012)
- Lecture Notes in Computer Science
Descriptional Complexity of Formal Systems; 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012, Proceedings A Jez, A Okhotin