Two-Way Unary Automata versus Logarithmic Space

DOI10.1007/978-3-642-14455-4_19zbMath1250.68157DBLPconf/dlt/GeffertP10OpenAlexW1531148340WikidataQ61677516 ScholiaQ61677516MaRDI QIDQ3584893

Viliam Geffert, Giovanni Pighizzini

Publication date: 31 August 2010

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14455-4_19

zbMATH Keywords

finite automatastate complexitylogarithmic spacespace complexityunary regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Two-Way Automata versus Logarithmic Space ⋮ Nondeterminism Is Essential in Small 2FAs with Few Reversals

This page was built for publication: Two-Way Unary Automata versus Logarithmic Space