@inproceedings{934ab9945d4245248a25b8cf172faaa5,
title = "Graph-Walking Automata: From Whence They Come, and Whither They are Bound",
abstract = "Graph-walking automata are finite automata walking on graphs given as an input; tree-walking automata and two-way finite automata are their well-known special cases. Graph-walking automata can be regarded both as a model of navigation in an unknown environment, and as a generic computing device, with the graph as the model of its memory. This paper presents the known results on these automata, ranging from their limitations in traversing graphs, studied already in the 1970s, to the recent work on the logical reversibility of their computations.",
author = "Alexander Okhotin",
year = "2019",
month = jul,
day = "1",
doi = "10.1007/978-3-030-23679-3_2",
language = "English",
isbn = "9783030236786",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "10--29",
editor = "Michal Hospod{\'a}r and Galina Jir{\'a}skov{\'a}",
booktitle = "Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings",
address = "Germany",
note = "24th International Conference on Implementation and Application of Automata, CIAA 2019 ; Conference date: 22-07-2019 Through 25-07-2019",
}