Alexander Okhotin
Publications 
1 of 7
- 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 )
UTU Research Portal