A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton

DOI10.1109/T-C.1971.223273zbMath0218.02032OpenAlexW2155870982MaRDI QIDQ5622170

Bruce H. Barnes

Publication date: 1971

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/t-c.1971.223273

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (3)

Finite automata and unary languages ⋮ An asymmetric regular set ⋮ Deterministic one-way simulation of two-way deterministic finite automata over small alphabets

This page was built for publication: A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton