Alexander Okhotin
3 of 7
- 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
- Transforming two-way alternating finite automata to one-way nondeterministic automata (2014)
- Lecture Notes in Computer Science
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (2013)
- Computer Science Review
- HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES (2013)
- International Journal of Foundations of Computer Science
- Homomorphisms preserving deterministic context-free languages (2013)
- International Journal of Foundations of Computer Science
- Improved normal form for grammars with one-sided contexts (2013)
- Lecture Notes in Computer Science
- 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
UTU Research Portal