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.

@inproceedings{Durak05,
  title = {Two-way non-deterministic finite automata with a write-once track recognize regular languages only},
  author = {Berke Durak},
  year = {2005},
  researchr = {https://researchr.org/publication/Durak05},
  cites = {0},
  citedby = {0},
  pages = {97-109},
  booktitle = {7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings},
  editor = {Carlo Mereghetti and Beatrice Palano and Giovanni Pighizzini and Detlef Wotschke},
  publisher = {Università degli Studi di Milano, Milan, Italy},
}