Alexander Okhotin

alexander.okhotin@utu.fi

1 of 7

Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts (2017)
- Theory of Computing Systems
Barash M, Okhotin A
State complexity of operations on input-driven pushdown automata (2017)
- Journal of Computer and System Sciences
Alexander Okhotin, Kai Salomaa
Computational and proof complexity of partial string avoidability (2016)
- LIPICS – Leibniz International Proceedings in Informatics
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) Dimitry Itsykson, Alexander Okhotin, Vsevolod Oparin
Descriptional Complexity of Formal Systems (2016)
- Theoretical Computer Science
Jurgensen H, Karhumaki J, Okhotin A
Equations over sets of integers with addition only (2016)
- Journal of Computer and System Sciences
Jez A, Okhotin A
Input-driven languages are linear conjunctive (2016)
- Theoretical Computer Science
Alexander Okhotin
Least and greatest solutions of equations over sets of integers (2016)
- Theoretical Computer Science
Jez A, Okhotin A
The Hardest Language for Conjunctive Grammars (2016) Computer Science – Theory and Applications Okhotin A
Descriptional complexity of unambiguous input-driven pushdown automata (2015)
- Theoretical Computer Science
Alexander Okhotin, Kai Salomaa
Generalized LR Parsing for Grammars with Contexts (2015)
- Lecture Notes in Computer Science
Mikhail Barash, Alexander Okhotin