Alexander Okhotin
Publications 
1 of 4
- Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts (2017)
- Theory of Computing Systems
(A1 Refereed original research article in a scientific journal) - State complexity of operations on input-driven pushdown automata (2017)
- Journal of Computer and System Sciences
(A1 Refereed original research article in a scientific journal) - Computational and proof complexity of partial string avoidability (2016)
- LIPICS – Leibniz international proceedings in informatics
(A4 Refereed article in a conference publication ) - Descriptional Complexity of Formal Systems (2016)
- Theoretical Computer Science
(B1 Non-refereed article in a scientific journal) - Equations over sets of integers with addition only (2016)
- Journal of Computer and System Sciences
(A1 Refereed original research article in a scientific journal) - Input-driven languages are linear conjunctive (2016)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Least and greatest solutions of equations over sets of integers (2016)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - The Hardest Language for Conjunctive Grammars (2016) Computer Science – Theory and Applications Okhotin A
(A4 Refereed article in a conference publication ) - Descriptional complexity of unambiguous input-driven pushdown automata (2015)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Generalized LR Parsing for Grammars with Contexts (2015)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Improved normal form for grammars with one-sided contexts (2015)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Linear Grammars with One-Sided Contexts and their Automaton Representation (2015)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(Other publication) - On language equations with concatenation and various sets of boolean operations.. (2015)
- RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
(A1 Refereed original research article in a scientific journal) - Two-sided context specifications in formal grammars (2015)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - An extension of context-free grammars with one-sided context specifications (2014)
- Information and Computation
(A1 Refereed original research article in a scientific journal) - Complexity of input-driven pushdown automata (2014)
- SIGACT News
(B1 Non-refereed article in a scientific journal) - Computational completeness of equations over sets of natural numbers (2014)
- Information and Computation
(A1 Refereed original research article in a scientific journal) - Grammars with two-sided contexts (2014)
- Electronic Proceedings in Theoretical Computer Science
(A4 Refereed article in a conference publication ) - Input-driven pushdown automata with limited nondeterminism (2014) Developments in Language Theory Alexander Okhotin, Kai Salomaa
(B3 Non-refereed article in a conference publication) - Linear grammars with one-sided contexts and their automaton representation (2014)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication )
UTU Research Portal