| Publication | Date of Publication | Type |
|---|
Decision problems for reversible and permutation automata
Information and Computation | 2026-09-18 | Paper |
State complexity of Boolean operations on graph-walking automata
International Journal of Foundations of Computer Science | 2026-08-20 | Paper |
Deterministic one-way simulation of two-way deterministic finite automata over small alphabets
International Journal of Foundations of Computer Science | 2026-08-20 | Paper |
Improved bounds on the length of shortest strings accepted by two-way finite automata
Information and Computation | 2026-06-23 | Paper |
| Lower bounds for graph-walking automata | 2026-04-21 | Paper |
Sweeping permutation automata
Acta Informatica | 2026-02-20 | Paper |
A time to cast away stones: on a family of pebble automata
International Journal of Foundations of Computer Science | 2026-02-17 | Paper |
| A hierarchy of reversible finite automata | 2026-02-10 | Paper |
| From regular expressions to deterministic finite automata: \(2^{\frac{n}{2}+\sqrt{n}(\log n)^{\varTheta (1)}}\) states are necessary and sufficient | 2026-02-10 | Paper |
| Simulating two-way nondeterministic finite automata over small alphabets by one-way nondeterministic automata | 2026-02-10 | Paper |
| On the transformation of two-way nondeterministic finite automata to unambiguous finite automata | 2026-02-10 | Paper |
On the expressive power of categorial grammars with unique category assignment
Journal of Logic, Language and Information | 2025-12-29 | Paper |
Decision problems for systems of language equations and inequations
Information and Computation | 2025-12-15 | Paper |
| Sweeping permutation automata | 2025-08-19 | Paper |
Probabilistic input-driven pushdown automata
Information and Computation | 2025-06-27 | Paper |
A parallel algorithm for counting parse trees
Information and Computation | 2025-02-28 | Paper |
| Decision problems for reversible and permutation automata | 2025-01-20 | Paper |
| Nondeterministic tree-walking automata are not closed under complementation | 2025-01-01 | Paper |
| Parallel enumeration of parse trees | 2024-12-03 | Paper |
| Probabilistic input-driven pushdown automata | 2024-12-03 | Paper |
Rational index of languages defined by grammars with bounded dimension of parse trees
Theory of Computing Systems | 2024-07-29 | Paper |
\(\mathrm{GF}(2)\)-operations on basic families of formal languages
Theoretical Computer Science | 2024-03-28 | Paper |
A time to cast away stones
Implementation and Application of Automata | 2024-02-28 | Paper |
On hardest languages for one-dimensional cellular automata
Information and Computation | 2024-02-02 | Paper |
On the transformation of two-way finite automata to unambiguous finite automata
Information and Computation | 2024-02-02 | Paper |
Conjunctive categorial grammars and Lambek grammars with additives
(available as arXiv preprint) | 2024-01-01 | Paper |
| On the rank of the communication matrix for deterministic two-way finite automata | 2023-12-10 | Paper |
| scientific article; zbMATH DE number 7770054 (Why is no real title available?) | 2023-11-23 | Paper |
Homomorphisms and inverse homomorphisms on graph-walking automata
Theoretical Computer Science | 2023-10-26 | Paper |
Shortest accepted strings for two-way finite automata: approaching the \(2^n\) lower bound
Descriptional Complexity of Formal Systems | 2023-08-17 | Paper |
The Hardest LL(k) Language
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Non-closure under complementation for unambiguous linear grammars
Information and Computation | 2023-05-19 | Paper |
The hardest language for grammars with context operators
Theoretical Computer Science | 2023-05-02 | Paper |
On the transformation of LL(k)-linear to LL(1)-linear grammars
Theory of Computing Systems | 2023-05-02 | Paper |
State complexity of transforming graph-walking automata to halting, returning and reversible
Information and Computation | 2023-03-07 | Paper |
On the rank of the communication matrix for deterministic two-way finite automata
(available as arXiv preprint) | 2023-01-01 | Paper |
On the determinization of event-clock input-driven pushdown automata
(available as arXiv preprint) | 2022-11-11 | Paper |
| Deterministic one-way simulation of two-way deterministic finite automata over small alphabets | 2022-11-09 | Paper |
| State complexity of union and intersection on graph-walking automata | 2022-11-09 | Paper |
On the Transformation of LL(k)-linear Grammars to LL(1)-linear
Computer Science – Theory and Applications | 2022-10-19 | Paper |
Homomorphisms on graph-walking automata
(available as arXiv preprint) | 2022-08-16 | Paper |
| Rational index of languages with bounded dimension of parse trees | 2022-08-11 | Paper |
| The hardest \(\operatorname{LL}(k)\) language | 2022-03-25 | Paper |
| Input-driven pushdown automata on well-nested infinite strings | 2022-03-21 | Paper |
State complexity of GF(2)-operations on unary languages
Information and Computation | 2022-03-14 | Paper |
Computational and proof complexity of partial string avoidability
ACM Transactions on Computation Theory | 2022-03-14 | Paper |
Formal languages over GF(2)
Information and Computation | 2022-03-14 | Paper |
| Language equations | 2022-02-04 | Paper |
On the length of shortest strings accepted by two-way finite automata
Fundamenta Informaticae | 2021-10-25 | Paper |
| On the transformation of two-way deterministic finite automata to unambiguous finite automata | 2021-10-04 | Paper |
| On hardest languages for one-dimensional cellular automata | 2021-10-04 | Paper |
| Longer shortest strings in two-way finite automata | 2021-07-14 | Paper |
| State complexity of GF(2)-inverse and GF(2)-star on binary languages | 2021-07-14 | Paper |
Grammars with two-sided contexts
(available as arXiv preprint) | 2021-06-22 | Paper |
| Grammars with two-sided contexts | 2021-06-22 | Paper |
| Nondeterministic state complexity of positional addition | 2021-01-26 | Paper |
scientific article; zbMATH DE number 7298596 (Why is no real title available?)
(available as arXiv preprint) | 2021-01-20 | Paper |
| scientific article; zbMATH DE number 7298596 (Why is no real title available?) | 2021-01-20 | Paper |
Reversibility of computations in graph-walking automata
Information and Computation | 2020-12-15 | Paper |
Extensions of unification modulo ACUI
Mathematical Structures in Computer Science | 2020-12-08 | Paper |
| On the expressive power of GF(2)-grammars | 2020-10-22 | Paper |
| Cyclic shift on multi-component grammars | 2020-07-27 | Paper |
Further closure properties of input-driven pushdown automata
Descriptional Complexity of Formal Systems | 2020-06-30 | Paper |
| State complexity of unambiguous operations on deterministic finite automata | 2020-06-30 | Paper |
| State complexity of GF(2)-concatenation and GF(2)-inverse on unary languages | 2020-05-12 | Paper |
| Graph-walking automata: from whence they come, and whither they are bound | 2020-05-06 | Paper |
State complexity of the quotient operation on input-driven pushdown automata
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
State complexity of unambiguous operations on finite automata
Theoretical Computer Science | 2019-11-07 | Paper |
Further closure properties of input-driven pushdown automata
Theoretical Computer Science | 2019-11-07 | Paper |
| On the length of shortest strings accepted by two-way finite automata | 2019-10-15 | Paper |
Edit distance neighbourhoods of input-driven pushdown automata
Theoretical Computer Science | 2019-06-18 | Paper |
Hardest languages for conjunctive and Boolean grammars
Information and Computation | 2019-05-02 | Paper |
| A tale of conjunctive grammars | 2018-11-22 | Paper |
| Towards exact state complexity bounds for input-driven pushdown automata | 2018-11-22 | Paper |
On the number of nonterminal symbols in unambiguous conjunctive grammars
Fundamenta Informaticae | 2018-10-02 | Paper |
| Underlying principles and recurring ideas of formal grammars | 2018-06-26 | Paper |
Formal languages over GF(2)
Language and Automata Theory and Applications | 2018-06-26 | Paper |
| scientific article; zbMATH DE number 6851884 (Why is no real title available?) | 2018-03-21 | Paper |
Linear-space recognition for grammars with contexts
Theoretical Computer Science | 2018-03-12 | Paper |
| Conjunctive categorial grammars | 2017-12-18 | Paper |
Generalized LR parsing algorithm for grammars with one-sided contexts
Theory of Computing Systems | 2017-10-20 | Paper |
| The quotient operation on input-driven pushdown automata | 2017-08-31 | Paper |
Edit distance neighbourhoods of input-driven pushdown automata
Computer Science – Theory and Applications | 2017-08-22 | Paper |
State complexity of operations on input-driven pushdown automata
Journal of Computer and System Sciences | 2017-05-26 | Paper |
On the state complexity of operations on two-way finite automata
Information and Computation | 2017-03-16 | Paper |
Unambiguous conjunctive grammars over a one-symbol alphabet
Theoretical Computer Science | 2017-02-06 | Paper |
Approximate unification in the description logic \(\mathcal {FL}_0\)
Logics in Artificial Intelligence | 2016-11-30 | Paper |
Nondeterministic state complexity of positional addition
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
The hardest language for conjunctive grammars
Computer Science – Theory and Applications | 2016-07-25 | Paper |
Equations over sets of integers with addition only
Journal of Computer and System Sciences | 2016-06-13 | Paper |
Least and greatest solutions of equations over sets of integers
Theoretical Computer Science | 2016-02-26 | Paper |
Input-driven languages are linear conjunctive
Theoretical Computer Science | 2016-02-18 | Paper |
On language equations with concatenation and various sets of Boolean operations
RAIRO - Theoretical Informatics and Applications | 2016-01-22 | Paper |
Generalized LR parsing for grammars with contexts
Lecture Notes in Computer Science | 2015-10-20 | Paper |
On the determinization blowup for finite automata recognizing equal-length languages
Computing with New Resources | 2015-09-08 | Paper |
Linear grammars with one-sided contexts and their automaton representation
RAIRO - Theoretical Informatics and Applications | 2015-08-14 | Paper |
Two-sided context specifications in formal grammars
Theoretical Computer Science | 2015-07-13 | Paper |
Improved normal form for grammars with one-sided contexts
Theoretical Computer Science | 2015-06-11 | Paper |
Descriptional complexity of unambiguous input-driven pushdown automata
Theoretical Computer Science | 2015-01-06 | Paper |
Input-Driven Pushdown Automata with Limited Nondeterminism
Developments in Language Theory | 2014-10-14 | Paper |
Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Homomorphisms preserving deterministic context-free languages
International Journal of Foundations of Computer Science | 2014-08-04 | Paper |
