Alexander Okhotin
Publications 
2 of 4
- On the determinization blowup for finite automata recognizing equal-length languages (2014) Computing with New Resources Juhani Karhumäki, Alexander Okhotin
(A3 Refereed book chapter or chapter in a compilation book) - Parsing by matrix multiplication generalized to Boolean grammars (2014)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Transforming two-way alternating finite automata to one-way nondeterministic automata (2014)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Conjunctive and Boolean grammars: the true general case of the context-free grammars (2013)
- Computer Science Review
(A2 Refereed review article in a scientific journal ) - HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES (2013)
- International Journal of Foundations of Computer Science
(A1 Refereed original research article in a scientific journal) - Homomorphisms preserving deterministic context-free languages (2013)
- International Journal of Foundations of Computer Science
(A1 Refereed original research article in a scientific journal) - Improved normal form for grammars with one-sided contexts (2013)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Input-driven pushdown automata: nondeterminism and unambiguity (2013) Fifth Worskshop on Non-Classical Models of Automata and Applications (NCMA 2013) Alexander Okhotin, Kai Salomaa
(A4 Refereed article in a conference publication ) - 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
(A4 Refereed article in a conference publication ) - On language equations with one-sided concatenation (2013)
- Fundamenta Informaticae
(A1 Refereed original research article in a scientific journal) - Reversibility of computations in graph-walking automata (2013)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Unambiguous conjunctive grammars over a one-letter alphabet (2013) Developments in Language Theory Artur Jez, Alexander Okhotin
(A4 Refereed article in a conference publication ) - Defining contexts in context-free grammars (2012)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Descriptional complexity of input-driven pushdown automata (2012)
- Lecture Notes in Computer Science
(A1 Refereed original research article in a scientific journal) - Homomorphisms preserving deterministic context-free languages (2012)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Language equations with complementation: Expressive power (2012)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Language Equations with Symmetric Difference (2012)
- Fundamenta Informaticae
(A1 Refereed original research article in a scientific journal) - Non-erasing variants of the Chomsky--Schützenberger theorem (2012)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - On the expressive power of univariate equations over sets of natural numbers (2012)
- Information and Computation
(A1 Refereed original research article in a scientific journal) - On the number of nonterminal symbols in unambiguous conjunctive grammars (2012)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication )
UTU Research Portal