Conjunctive Grammars. - Alexander Okhotin (J. Autom. Lang. Comb., 2001)

Automaton Representation of Linear Conjunctive Languages. - Alexander Okhotin (Developments in Language Theory, 2002)

Whale Calf, a Parser Generator for Conjunctive Grammars. - Alexander Okhotin (CIAA, 2002)

One-Visit Caterpillar Tree Automata. - Alexander Okhotin; Kai Salomaa; Michael Domaratzki (Fundam. Informaticae, 2002)

Top-Down Parsing of Conjunctive Languages. - Alexander Okhotin (Grammars, 2002)

LR Parsing for Conjunctive Grammars. - Alexander Okhotin (Grammars, 2002)

Conjunctive Grammars and Systems of Language Equations. - Alexander Okhotin (Program. Comput. Softw., 2002)

Decision Problems for Language Equations with Boolean Operations. - Alexander Okhotin (ICALP, 2003)

An overview of conjunctive grammars, Formal Language Theory Column. - Alexander Okhotin (Bull. EATCS, 2003)

Efficient Automaton-Based Recognition For Linear Conjunctive Languages. - Alexander Okhotin (Int. J. Found. Comput. Sci., 2003)

The hardest linear conjunctive language. - Alexander Okhotin (Inf. Process. Lett., 2003)

A recognition and parsing algorithm for arbitrary conjunctive grammars. - Alexander Okhotin (Theor. Comput. Sci., 2003)

On the closure properties of linear conjunctive languages. - Alexander Okhotin (Theor. Comput. Sci., 2003)

On Computational Universality in Language Equations. - Alexander Okhotin (MCU, 2004)

Boolean grammars. - Alexander Okhotin (Inf. Comput., 2004)

On the equivalence of linear conjunctive grammars and trellis automata. - Alexander Okhotin (RAIRO Theor. Informatics Appl., 2004)

State Complexity of Linear Conjunctive Languages. - Alexander Okhotin (J. Autom. Lang. Comb., 2004)

Representing recursively enumerable languages by iterated deletion. - Michael Domaratzki; Alexander Okhotin (Theor. Comput. Sci., 2004)

On the number of nonterminals in linear conjunctive grammars. - Alexander Okhotin (Theor. Comput. Sci., 2004)

LR Parsing for Boolean Grammars. - Alexander Okhotin (Developments in Language Theory, 2005)

Strict Language Inequalities and Their Decision Problems. - Alexander Okhotin (MFCS, 2005)

Contextual Grammars with Uniform Sets of Trajectories. - Alexander Okhotin; Kai Salomaa (Fundam. Informaticae, 2005)

A characterization of the arithmetical hierarchy by language equations. - Alexander Okhotin (Int. J. Found. Comput. Sci., 2005)

The dual of concatenation. - Alexander Okhotin (Theor. Comput. Sci., 2005)

Unresolved systems of language equations: Expressive power and decision problems. - Alexander Okhotin (Theor. Comput. Sci., 2005)

Language Equations with Complementation. - Alexander Okhotin; Oksana Yakimova (Developments in Language Theory, 2006)

Communication of Two Stacks and Rewriting. - Juhani Karhumäki; Michal Kunc; Alexander Okhotin (ICALP (2), 2006)

Computational Universality in One-variable Language Equations. - Alexander Okhotin (Fundam. Informaticae, 2006)

Generalized Lr Parsing Algorithm for Boolean Grammars. - Alexander Okhotin (Int. J. Found. Comput. Sci., 2006)

Computing by commuting. - Juhani Karhumäki; Michal Kunc; Alexander Okhotin (Theor. Comput. Sci., 2006)

A Simple P-Complete Problem and Its Representations by Language Equations. - Alexander Okhotin (MCU, 2007)

Recursive descent parsing for Boolean grammars. - Alexander Okhotin (Acta Informatica, 2007)

Nine Open Problems on Conjunctive and Boolean Grammars. - Alexander Okhotin (Bull. EATCS, 2007)

Notes on Dual Concatenation. - Alexander Okhotin (Int. J. Found. Comput. Sci., 2007)

Enumeration of Context-Free Languages and Related Structures. - Michael Domaratzki; Alexander Okhotin; Jeffrey O. Shallit (J. Autom. Lang. Comb., 2007)

Language equations with complementation: Decision problems. - Alexander Okhotin; Oksana Yakimova (Theor. Comput. Sci., 2007)

Complexity of solutions of equations over sets of natural numbers. - Alexander Okhotin; Artur Jez (STACS, 2008)

Representing a P-complete problem by small trellis automata - Alexander Okhotin (CSP, 2008)

Unambiguous Boolean grammars. - Alexander Okhotin (Inf. Comput., 2008)

State complexity of cyclic shift. - Galina Jirásková; Alexander Okhotin (RAIRO Theor. Informatics Appl., 2008)

Homomorphisms Preserving Linear Conjunctive Languages. - Alexander Okhotin (J. Autom. Lang. Comb., 2008)

Equations over Sets of Natural Numbers with Addition Only. - Artur Jez; Alexander Okhotin (STACS, 2009)

Nondeterministic State Complexity of Positional Addition - Galina Jirásková; Alexander Okhotin (DCFS, 2009)

State complexity of power. - Michael Domaratzki; Alexander Okhotin (Theor. Comput. Sci., 2009)

Parsing Unary Boolean Grammars Using Online Convolution. - Alexander Okhotin; Christian Reitwießner (Advances and Applications of Automata on Words and Trees, 2010)

On Language Equations XXK = XXL and XM = N over a Unary Alphabet. - Tommi Lehtinen 001; Alexander Okhotin (Developments in Language Theory, 2010)

Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm. - Alexander Okhotin (Developments in Language Theory, 2010)

On Equations over Sets of Integers. - Artur Jez; Alexander Okhotin (STACS, 2010)

Univariate Equations Over Sets of Natural Numbers. - Artur Jez; Alexander Okhotin (Fundam. Informaticae, 2010)

On the State Complexity of Scattered Substrings and Superstrings. - Alexander Okhotin (Fundam. Informaticae, 2010)

Computational power of two stacks with restricted communication. - Juhani Karhumäki; Michal Kunc; Alexander Okhotin (Inf. Comput., 2010)

Boolean Grammars and GSM Mappings. - Tommi Lehtinen 001; Alexander Okhotin (Int. J. Found. Comput. Sci., 2010)

Decision problems for language equations. - Alexander Okhotin (J. Comput. Syst. Sci., 2010)

Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. - Artur Jez; Alexander Okhotin (Theory Comput. Syst., 2010)

On stateless multihead automata: Hierarchies and the emptiness problem. - Oscar H. Ibarra; Juhani Karhumäki; Alexander Okhotin (Theor. Comput. Sci., 2010)

Conjunctive grammars with restricted disjunction. - Alexander Okhotin; Christian Reitwießner (Theor. Comput. Sci., 2010)

State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet. - Michal Kunc; Alexander Okhotin (DCFS, 2011)

Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups. - Michal Kunc; Alexander Okhotin (Developments in Language Theory, 2011)

Descriptional Complexity of Unambiguous Nested Word Automata. - Alexander Okhotin; Kai Salomaa (LATA, 2011)

Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages. - Alexander Okhotin (SOFSEM, 2011)

On the State Complexity of Star of Union and Star of Intersection. - Galina Jirásková; Alexander Okhotin (Fundam. Informaticae, 2011)

State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata. - Michal Kunc; Alexander Okhotin (Fundam. Informaticae, 2011)

On Equations over Sets of Numbers and their Limitations. - Tommi Lehtinen 001; Alexander Okhotin (Int. J. Found. Comput. Sci., 2011)

Complexity of Equations over Sets of Natural Numbers. - Artur Jez; Alexander Okhotin (Theory Comput. Syst., 2011)

One-Nonterminal Conjunctive Grammars over a Unary Alphabet. - Artur Jez; Alexander Okhotin (Theory Comput. Syst., 2011)

A simple P-complete problem and its language-theoretic representations. - Alexander Okhotin (Theor. Comput. Sci., 2011)

Expressive power of LL(k) Boolean grammars. - Alexander Okhotin (Theor. Comput. Sci., 2011)

Descriptional Complexity of Input-Driven Pushdown Automata. - Alexander Okhotin; Xiaoxue Piao; Kai Salomaa (Languages Alive, 2012)

Non-erasing Variants of the Chomsky-Schützenberger Theorem. - Alexander Okhotin (Developments in Language Theory, 2012)

Defining Contexts in Context-Free Grammars. - Mikhail Barash; Alexander Okhotin (LATA, 2012)

Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints. - Franz Baader; Alexander Okhotin (LPAR, 2012)

Language Equations with Symmetric Difference. - Alexander Okhotin (Fundam. Informaticae, 2012)

Unambiguous finite automata over a unary alphabet. - Alexander Okhotin (Inf. Comput., 2012)

On the expressive power of univariate equations over sets of natural numbers. - Alexander Okhotin; Panos Rondogiannis (Inf. Comput., 2012)

Representing Hyper-arithmetical Sets by Equations over Sets of Integers. - Artur Jez; Alexander Okhotin (Theory Comput. Syst., 2012)

State complexity of operations on two-way finite automata over a unary alphabet. - Michal Kunc; Alexander Okhotin (Theor. Comput. Sci., 2012)

Parsing Boolean grammars over a one-letter alphabet using online convolution. - Alexander Okhotin; Christian Reitwießner (Theor. Comput. Sci., 2012)

Language equations with complementation: Expressive power. - Alexander Okhotin; Oksana Yakimova (Theor. Comput. Sci., 2012)

Unambiguous Conjunctive Grammars over a One-Letter Alphabet. - Artur Jez; Alexander Okhotin (Developments in Language Theory, 2013)

One-way simulation of two-way finite automata over small alphabets. - Viliam Geffert; Alexander Okhotin (NCMA, 2013)

Input-driven pushdown automata: nondeterminism and unambiguity. - Alexander Okhotin; Kai Salomaa (NCMA, 2013)

Conjunctive and Boolean grammars: The true general case of the context-free grammars. - Alexander Okhotin (Comput. Sci. Rev., 2013)

On Language Equations with One-sided Concatenation. - Franz Baader; Alexander Okhotin (Fundam. Informaticae, 2013)

Homomorphisms Preserving Deterministic Context-Free Languages. - Tommi Lehtinen 001; Alexander Okhotin (Int. J. Found. Comput. Sci., 2013)

On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages. - Juhani Karhumäki; Alexander Okhotin (Computing with New Resources, 2014)

Input-Driven Pushdown Automata with Limited Nondeterminism - (Invited Paper). - Alexander Okhotin; Kai Salomaa (Developments in Language Theory, 2014)

Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata. - Viliam Geffert; Alexander Okhotin (MFCS (1), 2014)

Grammars with two-sided contexts. - Mikhail Barash; Alexander Okhotin (AFL, 2014)

An extension of context-free grammars with one-sided context specifications. - Mikhail Barash; Alexander Okhotin (Inf. Comput., 2014)

Computational completeness of equations over sets of natural numbers. - Artur Jez; Alexander Okhotin (Inf. Comput., 2014)

Complexity of input-driven pushdown automata. - Alexander Okhotin; Kai Salomaa (SIGACT News, 2014)

Parsing by matrix multiplication generalized to Boolean grammars. - Alexander Okhotin (Theor. Comput. Sci., 2014)

Generalized LR Parsing for Grammars with Contexts. - Mikhail Barash; Alexander Okhotin (CSR, 2015)

Linear grammars with one-sided contexts and their automaton representation. - Mikhail Barash; Alexander Okhotin (RAIRO Theor. Informatics Appl., 2015)

On language equations with concatenation and various sets of Boolean operations. - Alexander Okhotin (RAIRO Theor. Informatics Appl., 2015)

Two-sided context specifications in formal grammars. - Mikhail Barash; Alexander Okhotin (Theor. Comput. Sci., 2015)

Improved normal form for grammars with one-sided contexts. - Alexander Okhotin (Theor. Comput. Sci., 2015)

Descriptional complexity of unambiguous input-driven pushdown automata. - Alexander Okhotin; Kai Salomaa (Theor. Comput. Sci., 2015)

The Hardest Language for Conjunctive Grammars. - Alexander Okhotin (CSR, 2016)

Approximate Unification in the Description Logic FL_0. - Franz Baader; Pavlos Marantidis; Alexander Okhotin (JELIA, 2016)

Approximately Solving Set Equations. - Franz Baader; Pavlos Marantidis; Alexander Okhotin (UNIF, 2016)

Equations over sets of integers with addition only. - Artur Jez; Alexander Okhotin (J. Comput. Syst. Sci., 2016)

Least and greatest solutions of equations over sets of integers. - Artur Jez; Alexander Okhotin (Theor. Comput. Sci., 2016)

Descriptional Complexity of Formal Systems. - Helmut Jürgensen; Juhani Karhumäki; Alexander Okhotin (Theor. Comput. Sci., 2016)

Input-driven languages are linear conjunctive. - Alexander Okhotin (Theor. Comput. Sci., 2016)

The Quotient Operation on Input-Driven Pushdown Automata. - Alexander Okhotin; Kai Salomaa (DCFS, 2017)

Conjunctive Categorial Grammars. - Stepan L. Kuznetsov; Alexander Okhotin (MOL, 2017)

On the state complexity of operations on two-way finite automata. - Galina Jirásková; Alexander Okhotin (Inf. Comput., 2017)

State complexity of operations on input-driven pushdown automata. - Alexander Okhotin; Kai Salomaa (J. Comput. Syst. Sci., 2017)

Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts. - Mikhail Barash; Alexander Okhotin (Theory Comput. Syst., 2017)

Unambiguous conjunctive grammars over a one-symbol alphabet. - Artur Jez; Alexander Okhotin (Theor. Comput. Sci., 2017)

State Complexity of Unambiguous Operations on Deterministic Finite Automata. - Galina Jirásková; Alexander Okhotin (DCFS, 2018)

Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata. - Galina Jirásková; Alexander Okhotin (DLT, 2018)

A Tale of Conjunctive Grammars. - Alexander Okhotin (DLT, 2018)

Underlying Principles and Recurring Ideas of Formal Grammars. - Alexander Okhotin (LATA, 2018)

On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars. - Artur Jez; Alexander Okhotin (Fundam. Informaticae, 2018)

Preface. - Jeffrey O. Shallit; Alexander Okhotin (Inf. Comput., 2018)

Preface. - Jarkko Kari; Alexander Okhotin (Int. J. Found. Comput. Sci., 2018)

Linear-space recognition for grammars with contexts. - Mikhail Barash; Alexander Okhotin (Theor. Comput. Sci., 2018)

State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages. - Alexander Okhotin; Elizaveta Sazhneva (DCFS, 2019)

On the Expressive Power of GF(2)-Grammars. - Vladislav Makarov; Alexander Okhotin (SOFSEM, 2019)

Graph-Walking Automata: From Whence They Come, and Whither They are Bound. - Alexander Okhotin (CIAA, 2019)

Hardest languages for conjunctive and Boolean grammars. - Alexander Okhotin (Inf. Comput., 2019)

State Complexity of the Quotient Operation on Input-Driven Pushdown Automata. - Alexander Okhotin; Kai Salomaa (Int. J. Found. Comput. Sci., 2019)

State complexity of unambiguous operations on finite automata. - Galina Jirásková; Alexander Okhotin (Theor. Comput. Sci., 2019)

Edit distance neighbourhoods of input-driven pushdown automata. - Alexander Okhotin; Kai Salomaa (Theor. Comput. Sci., 2019)

Further closure properties of input-driven pushdown automata. - Alexander Okhotin; Kai Salomaa (Theor. Comput. Sci., 2019)

On the Transformation of LL(k)-linear Grammars to LL(1)-linear. - Alexander Okhotin; Ilya Olkhovsky (CSR, 2020)

Longer Shortest Strings in Two-Way Finite Automata. - Stanislav Krymski; Alexander Okhotin (DCFS, 2020)

Cyclic Shift on Multi-component Grammars. - Alexander Okhotin; Alexey Sorokin (LATA, 2020)

State complexity of halting, returning and reversible graph-walking automata. - Olga Martynova 001; Alexander Okhotin (CoRR, 2020)

Input-driven automata on well-nested infinite strings: automata-theoretic and topological properties. - Alexander Okhotin; Victor L. Selivanov (CoRR, 2020)

Describing the syntax of programming languages using conjunctive and Boolean grammars. - Alexander Okhotin (CoRR, 2020)

Rational index of bounded-oscillation languages. - Ekaterina N. Shemetova; Alexander Okhotin; Semyon V. Grigorev (CoRR, 2020)

Computational and proof complexity of partial string avoidability. - Dmitry Itsykson; Alexander Okhotin; Vsevolod Oparin (Electron. Colloquium Comput. Complex., 2020)

Reversibility of computations in graph-walking automata. - Michal Kunc; Alexander Okhotin (Inf. Comput., 2020)

Extensions of unification modulo ACUI. - Franz Baader; Pavlos Marantidis; Antoine Mottet; Alexander Okhotin (Math. Struct. Comput. Sci., 2020)

Language equations. - Michal Kunc; Alexander Okhotin (Handbook of Automata Theory (I.), 2021)

Input-Driven Pushdown Automata on Well-Nested Infinite Strings. - Alexander Okhotin; Victor L. Selivanov (CSR, 2021)

Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets. - Viliam Geffert; Alexander Okhotin (DCFS, 2021)

State Complexity of Union and Intersection on Graph-Walking Automata. - Olga Martynova 001; Alexander Okhotin (DCFS, 2021)

On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata. - Semyon Petrov; Alexander Okhotin (LATA, 2021)

Lower Bounds for Graph-Walking Automata. - Olga Martynova 001; Alexander Okhotin (STACS, 2021)

On LL(k) linear conjunctive grammars. - Ilya Olkhovsky; Alexander Okhotin (CoRR, 2021)

On the Length of Shortest Strings Accepted by Two-way Finite Automata. - Egor Dobronravov; Nikita Dobronravov; Alexander Okhotin (Fundam. Informaticae, 2021)

On the Determinization of Event-Clock Input-Driven Pushdown Automata. - Mizuhito Ogawa; Alexander Okhotin (CSR, 2022)

Rational Index of Languages with Bounded Dimension of Parse Trees. - Ekaterina N. Shemetova; Alexander Okhotin; Semyon V. Grigorev (DLT, 2022)

Homomorphisms on Graph-Walking Automata. - Olga Martynova 001; Alexander Okhotin (CIAA, 2022)

The maximum length of shortest accepted strings for direction-determinate two-way finite automata. - Olga Martynova 001; Alexander Okhotin (CoRR, 2022)

Formal languages over GF(2). - Ekaterina Bakinova; Artem Basharin; Igor Batmanov; Konstantin Lyubort; Alexander Okhotin; Elizaveta Sazhneva (Inf. Comput., 2022)

State complexity of GF(2)-operations on unary languages. - Alexander Okhotin; Elizaveta Sazhneva (Inf. Comput., 2022)

Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2n Lower Bound. - Olga Martynova 001; Alexander Okhotin (DCFS, 2023)

Parallel Enumeration of Parse Trees. - Margarita Mikhelson; Alexander Okhotin (MFCS, 2023)

A Time to Cast Away Stones. - Olga Martynova 001; Alexander Okhotin (CIAA, 2023)

Sweeping Permutation Automata. - Maria Radionova; Alexander Okhotin (NCMA, 2023)

On the rank of the communication matrix for deterministic two-way finite automata. - Semyon Petrov; Fedor Petrov 001; Alexander Okhotin (CoRR, 2023)

The Hardest LL(k) Language. - Mikhail Mrykhin; Alexander Okhotin (Int. J. Found. Comput. Sci., 2023)

State Complexity of GF(2)-Inverse and GF(2)-Star on Binary Languages. - Alexander Okhotin; Elizaveta Sazhneva (J. Autom. Lang. Comb., 2023)

State complexity of transforming graph-walking automata to halting, returning and reversible. - Olga Martynova 001; Alexander Okhotin (Inf. Comput., 2023)

On the Transformation of LL(k)-linear to LL(1)-linear Grammars. - Ilya Olkhovsky; Alexander Okhotin (Theory Comput. Syst., 2023)

Correction to: On the Transformation of LL(k)-linear to LL(1)-linear Grammars. - Ilya Olkhovsky; Alexander Okhotin (Theory Comput. Syst., 2023)

The hardest language for grammars with context operators. - Mikhail Mrykhin; Alexander Okhotin (Theor. Comput. Sci., 2023)

Non-closure under complementation for unambiguous linear grammars. - Olga Martynova 001; Alexander Okhotin (Inf. Comput., 2023)

Homomorphisms and inverse homomorphisms on graph-walking automata. - Olga Martynova 001; Alexander Okhotin (Theor. Comput. Sci., 2023)

On hardest languages for one-dimensional cellular automata. - Mikhail Mrykhin; Alexander Okhotin (Inf. Comput., 2023)

On the transformation of two-way finite automata to unambiguous finite automata. - Semyon Petrov; Alexander Okhotin (Inf. Comput., 2023)

Decision Problems for Reversible and Permutation Automata. - Maria Radionova; Alexander Okhotin (CIAA, 2024)

Conjunctive categorial grammars and Lambek grammars with additives. - Stepan L. Kuznetsov; Alexander Okhotin (CoRR, 2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata. - Semyon Petrov; Alexander Okhotin (CoRR, 2024)

GF(2)-operations on basic families of formal languages. - Alexander Okhotin; Maria Radionova; Elizaveta Sazhneva (Theor. Comput. Sci., 2024)

Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees. - Ekaterina N. Shemetova; Alexander Okhotin; Semyon V. Grigorev (Theory Comput. Syst., 2024)

On the Transformation of Two-Way Nondeterministic Finite Automata to Unambiguous Finite Automata. - Semyon Petrov; Alexander Okhotin (DLT, 2025)

Nondeterministic Tree-Walking Automata Are Not Closed Under Complementation. - Olga Martynova 001; Alexander Okhotin (ICALP, 2025)

Simulating Two-Way Nondeterministic Finite Automata Over Small Alphabets by One-Way Nondeterministic Automata. - Viliam Geffert; Alexander Okhotin (CIAA, 2025)

From Regular Expressions to Deterministic Finite Automata: $2^{ frac{n}{2}+ sqrt{n}( log n)^{ varTheta (1)}}$ States Are Necessary and Sufficient. - Olga Martynova 001; Alexander Okhotin (CIAA, 2025)

A Hierarchy of Reversible Finite Automata. - Maria Radionova; Alexander Okhotin (CIAA, 2025)

A parallel algorithm for counting parse trees. - Margarita Mikhelson; Alexander Okhotin (Inf. Comput., 2025)

Decision problems for systems of language equations and inequations. - Alexander Okhotin (Inf. Comput., 2025)

Probabilistic input-driven pushdown automata. - Alex Rose 003; Alexander Okhotin (Inf. Comput., 2025)

From regular expressions to deterministic finite automata: $2n/2+√n(log n)Θ(1) states are necessary and sufficient. - Olga Martynova 001; Alexander Okhotin (CoRR, 2025)