Automata and Computability
STACS '89 Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science
Converting two-way nondeterministic unary automata into simpler automata
Theoretical Computer Science - Mathematical foundations of computer science
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Algorithms and lower bounds in finite automata size complexity
Algorithms and lower bounds in finite automata size complexity
Complementing two-way finite automata
Information and Computation
A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton
IEEE Transactions on Computers
On the Size Complexity of Rotating and Sweeping Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Deterministic moles cannot solve liveness
Journal of Automata, Languages and Combinatorics
Size Complexity of Two-Way Finite Automata
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Finite automata and their decision problems
IBM Journal of Research and Development
The reduction of two-way automata to one-way automata
IBM Journal of Research and Development
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Two-way automata versus logarithmic space
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Small sweeping 2NFAs are not closed under complement
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Removing bidirectionality from nondeterministic finite automata
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Two-Way automata making choices only at the endmarkers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
An alternating hierarchy for finite automata
Theoretical Computer Science
Analogs of fagin's theorem for small nondeterministic finite automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Nondeterminism is essential in small two-way finite automata with few reversals
Information and Computation
Nondeterminism is essential in small two-way finite automata with few reversals
Information and Computation
One alternation can be more powerful than randomization in small and fast two-way finite automata
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
This is a talk on minicomplexity, namely on the complexity of two-way finite automata. We start with a smooth introduction to its basic concepts, which also brings together several seemingly detached, old theorems. We then record recent advances, both in the theory itself and in its relation to Turing machine complexity. Finally, we illustrate a proof technique, which we call hardness propagation by certificates. The entire talk follows, extends, and advocates the Sakoda-Sipser framework.