Deterministic Ordered Restarting Automata that Compute Functions

Friedrich Otto, Kent Kwee. Deterministic Ordered Restarting Automata that Compute Functions. In Igor Potapov, editor, Developments in Language Theory - 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. Volume 9168 of Lecture Notes in Computer Science, pages 401-412, Springer, 2015. [doi]

@inproceedings{OttoK15,
  title = {Deterministic Ordered Restarting Automata that Compute Functions},
  author = {Friedrich Otto and Kent Kwee},
  year = {2015},
  doi = {10.1007/978-3-319-21500-6_32},
  url = {http://dx.doi.org/10.1007/978-3-319-21500-6_32},
  researchr = {https://researchr.org/publication/OttoK15},
  cites = {0},
  citedby = {0},
  pages = {401-412},
  booktitle = {Developments in Language Theory - 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings},
  editor = {Igor Potapov},
  volume = {9168},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-21499-3},
}