| Publication | Date of Publication | Type |
|---|
Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Improved complement for two-way alternating automata
Acta Informatica | 2022-09-26 | Paper |
Complement for two-way alternating automata
Acta Informatica | 2021-09-30 | Paper |
Alternation in two-way finite automata
Theoretical Computer Science | 2021-06-03 | Paper |
| Minicomplexity. Some motivation, some history, and some structure (invited talk extended abstract) | 2020-10-22 | Paper |
A logical characterization of small 2NFAs
International Journal of Foundations of Computer Science | 2018-02-22 | Paper |
A logical characterization of small 2NFAs
Implementation and Application of Automata | 2016-11-09 | Paper |
Two-way automata characterizations of L/poly versus NL
Theory of Computing Systems | 2015-07-20 | Paper |
| Minicomplexity | 2015-03-16 | Paper |
Predicate characterizations in the polynomial-size hierarchy
Language, Life, Limits | 2015-02-25 | Paper |
Two-way automata versus logarithmic space
Theory of Computing Systems | 2015-02-05 | Paper |
Nondeterminism is essential in small two-way finite automata with few reversals
Information and Computation | 2013-06-06 | Paper |
Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata
Developments in Language Theory | 2012-11-02 | Paper |
Minicomplexity
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
Reversal Hierarchies for Small 2DFAs
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Two-Way Automata Characterizations of L/poly versus NL
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Size complexity of rotating and sweeping automata
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Nondeterminism is essential in small 2FAs with few reversals
Automata, Languages and Programming | 2011-07-07 | Paper |
Two-Way Automata versus Logarithmic Space
Computer Science – Theory and Applications | 2011-06-17 | Paper |
Size Complexity of Two-Way Finite Automata
Developments in Language Theory | 2009-07-07 | Paper |
Small Sweeping 2NFAs Are Not Closed Under Complement
Automata, Languages and Programming | 2009-03-12 | Paper |
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata
Stochastic Algorithms: Foundations and Applications | 2009-03-05 | Paper |
On the Size Complexity of Rotating and Sweeping Automata
Developments in Language Theory | 2008-10-30 | Paper |
| Deterministic moles cannot solve liveness | 2008-08-12 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES
International Journal of Foundations of Computer Science | 2005-11-14 | Paper |
