Two-way non-deterministic finite automata with a write-once track recognize regular languages only

Berke Durak. Two-way non-deterministic finite automata with a write-once track recognize regular languages only. In Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini, Detlef Wotschke, editors, 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings. pages 97-109, Università degli Studi di Milano, Milan, Italy, 2005.

Abstract

Abstract is missing.