| 2026 | MFCS | On the Size Complexity of Two-Way Finite Automata with Drop-Once Pebbles. | Georgy Kipriyanov, Alexander Okhotin |
| 2025 | DLT | On the Transformation of Two-Way Nondeterministic Finite Automata to Unambiguous Finite Automata. | Semyon Petrov, Alexander Okhotin |
| 2025 | ICALP | Nondeterministic Tree-Walking Automata Are Not Closed Under Complementation. | Olga Martynova, Alexander Okhotin |
| 2023 | MFCS | Parallel Enumeration of Parse Trees. | Margarita Mikhelson, Alexander Okhotin |
| 2023 | MFCS | Probabilistic Input-Driven Pushdown Automata. | Alex Rose, Alexander Okhotin |
| 2022 | CSR | On the Determinization of Event-Clock Input-Driven Pushdown Automata. | Mizuhito Ogawa, Alexander Okhotin |
| 2022 | DLT | Rational Index of Languages with Bounded Dimension of Parse Trees. | Ekaterina N. Shemetova, Alexander Okhotin, Semyon V. Grigorev |
| 2021 | CSR | Input-Driven Pushdown Automata on Well-Nested Infinite Strings. | Alexander Okhotin, Victor L. Selivanov |
| 2021 | DLT | The Hardest LL(k) Language. | Mikhail Mrykhin, Alexander Okhotin |
| 2021 | LATA | On Hardest Languages for One-Dimensional Cellular Automata. | Mikhail Mrykhin, Alexander Okhotin |
| 2021 | LATA | On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata. | Semyon Petrov, Alexander Okhotin |
| 2021 | STACS | Lower Bounds for Graph-Walking Automata. | Olga Martynova, Alexander Okhotin |
| 2020 | CSR | On the Transformation of LL(k)-linear Grammars to LL(1)-linear. | Alexander Okhotin, Ilya Olkhovsky |
| 2020 | LATA | Cyclic Shift on Multi-component Grammars. | Alexander Okhotin, Alexey Sorokin |
| 2019 | DLT | On the Length of Shortest Strings Accepted by Two-Way Finite Automata. | Egor Dobronravov, Nikita Dobronravov, Alexander Okhotin |
| 2019 | SOFSEM | On the Expressive Power of GF(2)-Grammars. | Vladislav Makarov, Alexander Okhotin |
| 2018 | DLT | Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata. | Galina Jirskov, Alexander Okhotin |
| 2018 | DLT | A Tale of Conjunctive Grammars. | Alexander Okhotin |
| 2018 | LATA | Formal Languages over GF(2). | Ekaterina Bakinova, Artem Basharin, Igor Batmanov, Konstantin Lyubort, Alexander Okhotin, Elizaveta Sazhneva |
| 2018 | LATA | Underlying Principles and Recurring Ideas of Formal Grammars. | Alexander Okhotin |
| 2017 | CSR | Edit Distance Neighbourhoods of Input-Driven Pushdown Automata. | Alexander Okhotin, Kai Salomaa |
| 2016 | CSR | The Hardest Language for Conjunctive Grammars. | Alexander Okhotin |
| 2016 | JELIA | Approximate Unification in the Description Logic | Franz Baader, Pavlos Marantidis, Alexander Okhotin |
| 2016 | MFCS | Computational and Proof Complexity of Partial String Avoidability. | Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin |
| 2015 | CSR | Generalized LR Parsing for Grammars with Contexts. | Mikhail Barash, Alexander Okhotin |
| 2014 | DLT | Input-Driven Pushdown Automata with Limited Nondeterminism - (Invited Paper). | Alexander Okhotin, Kai Salomaa |
| 2014 | LATIN | Linear Grammars with One-Sided Contexts and Their Automaton Representation. | Mikhail Barash, Alexander Okhotin |
| 2014 | MFCS | Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata. | Viliam Geffert, Alexander Okhotin |
| 2013 | DLT | Unambiguous Conjunctive Grammars over a One-Letter Alphabet. | Artur Jez, Alexander Okhotin |
| 2013 | MFCS | Reversibility of Computations in Graph-Walking Automata. | Michal Kunc, Alexander Okhotin |
| 2012 | DLT | Homomorphisms Preserving Deterministic Context-Free Languages. | Tommi Lehtinen, Alexander Okhotin |
| 2012 | DLT | Non-erasing Variants of the Chomsky-Schtzenberger Theorem. | Alexander Okhotin |
| 2012 | LATA | Defining Contexts in Context-Free Grammars. | Mikhail Barash, Alexander Okhotin |
| 2012 | LPAR | Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints. | Franz Baader, Alexander Okhotin |
| 2011 | DLT | Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups. | Michal Kunc, Alexander Okhotin |
| 2011 | LATA | Descriptional Complexity of Unambiguous Nested Word Automata. | Alexander Okhotin, Kai Salomaa |
| 2011 | MFCS | State Complexity of Operations on Input-Driven Pushdown Automata. | Alexander Okhotin, Kai Salomaa |
| 2011 | SOFSEM | Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages. | Alexander Okhotin |
| 2010 | DLT | On Language Equations | Tommi Lehtinen, Alexander Okhotin |
| 2010 | DLT | Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm. | Alexander Okhotin |
| 2010 | MFCS | Least and Greatest Solutions of Equations over Sets of Integers. | Artur Jez, Alexander Okhotin |
| 2010 | MFCS | Unambiguous Finite Automata over a Unary Alphabet. | Alexander Okhotin |
| 2010 | STACS | On Equations over Sets of Integers. | Artur Jez, Alexander Okhotin |
| 2009 | CSR | One-Nonterminal Conjunctive Grammars over a Unary Alphabet. | Artur Jez, Alexander Okhotin |
| 2009 | DLT | On Equations over Sets of Numbers and Their Limitations. | Tommi Lehtinen, Alexander Okhotin |
| 2009 | STACS | Equations over Sets of Natural Numbers with Addition Only. | Artur Jez, Alexander Okhotin |
| 2009 | SOFSEM | Conjunctive Grammars with Restricted Disjunction. | Alexander Okhotin, Christian Reitwiener |
| 2008 | DLT | On the State Complexity of Operations on Two-Way Finite Automata. | Galina Jirskov, Alexander Okhotin |
| 2008 | ICALP | On the Computational Completeness of Equations over Sets of Natural Numbers. | Artur Jez, Alexander Okhotin |
| 2008 | LATIN | On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. | Oscar H. Ibarra, Juhani Karhumki, Alexander Okhotin |
| 2008 | STACS | Complexity of solutions of equations over sets of natural numbers. | Alexander Okhotin, Artur Jez |
| 2007 | CSR | Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. | Artur Jez, Alexander Okhotin |
| 2007 | FCT | Expressive Power of LL(k) Boolean Grammars. | Alexander Okhotin |
| 2007 | LATA | Unambiguous Boolean grammars. | Alexander Okhotin |
| 2007 | MCU | A Simple P-Complete Problem and Its Representations by Language Equations. | Alexander Okhotin |
| 2006 | CSR | Language Equations with Symmetric Difference. | Alexander Okhotin |
| 2006 | DLT | Language Equations with Complementation. | Alexander Okhotin, Oksana Yakimova |
| 2006 | ICALP | Communication of Two Stacks and Rewriting. | Juhani Karhumki, Michal Kunc, Alexander Okhotin |
| 2005 | DLT | LR Parsing for Boolean Grammars. | Alexander Okhotin |
| 2005 | MFCS | Strict Language Inequalities and Their Decision Problems. | Alexander Okhotin |
| 2004 | MCU | On Computational Universality in Language Equations. | Alexander Okhotin |
| 2004 | MFCS | The Dual of Concatenation. | Alexander Okhotin |
| 2003 | DLT | Boolean Grammars. | Alexander Okhotin |
| 2003 | ICALP | Decision Problems for Language Equations with Boolean Operations. | Alexander Okhotin |
| 2002 | DLT | Automaton Representation of Linear Conjunctive Languages. | Alexander Okhotin |