Oblivious Two-Way Finite Automata: Decidability and Complexity

Martin Kutrib, Andreas Malcher, Giovanni Pighizzini. Oblivious Two-Way Finite Automata: Decidability and Complexity. In David Fernández-Baca, editor, LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings. Volume 7256 of Lecture Notes in Computer Science, pages 518-529, Springer, 2012. [doi]

@inproceedings{KutribMP12,
  title = {Oblivious Two-Way Finite Automata: Decidability and Complexity},
  author = {Martin Kutrib and Andreas Malcher and Giovanni Pighizzini},
  year = {2012},
  doi = {10.1007/978-3-642-29344-3_44},
  url = {http://dx.doi.org/10.1007/978-3-642-29344-3_44},
  researchr = {https://researchr.org/publication/KutribMP12},
  cites = {0},
  citedby = {0},
  pages = {518-529},
  booktitle = {LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings},
  editor = {David Fernández-Baca},
  volume = {7256},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-29343-6},
}