scientific article
From MaRDI portal
Publication:3517105
DOI10.25596/jalc-2007-215zbMath1145.68461MaRDI QIDQ3517105
Publication date: 12 August 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
descriptional complexitySakoda-Sipser conjectureone-way nondeterministic finite automatatwo-way deterministic finite automata
Related Items (7)
Complementing two-way finite automata ⋮ Translation from classical two-way automata to pebble two-way automata ⋮ Two-Way Automata versus Logarithmic Space ⋮ Nondeterminism Is Essential in Small 2FAs with Few Reversals ⋮ Two-way automata versus logarithmic space ⋮ Two-way unary automata versus logarithmic space ⋮ Size Complexity of Two-Way Finite Automata
This page was built for publication:
