title Size complexity of two-way finite automata
author Christos A. Kapoutsis
meeting International Conference on Developments in Language Theory
year 2009
pages 47-66
topics computability and complexity; unary and general alphabets; one-way, rotating, sweeping, and two-way heads; deterministic, nondeterministic, alternating, and probabilistic modes
features one-way liveness$\leq^\text{t}_\text{h}$separability
pdf pubs/2009-kapoutsis-dlt.pdf
doi 10.1007/978-3-642-02737-6_4