Abstract
This is a talk on the size complexity of two-way finite automata. We present the central open problem in the area, explain a motivation behind it, recall its early history, and introduce some of the concepts used in its study. We then sketch a possible future, describe a natural systematic way of pursuing it, and record some of the progress that has been achieved. We add little to what is already known-only exposition, terminology, and questions. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Kapoutsis, C. A. (2009). Size complexity of two-way finite automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5583 LNCS, pp. 47–66). https://doi.org/10.1007/978-3-642-02737-6_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
