Graph-Walking Automata: From Whence They Come, and Whither They are Bound

DOI

https://doi.org/10.1007/978-3-030-23679-3_2
Final published version

Alexander Okhotin

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.

Original language	English
Title of host publication	Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings
Editors	Michal Hospodár, Galina Jirásková
Publisher	Springer Nature
Pages	10-29
Number of pages	20
ISBN (Print)	9783030236786
DOIs	https://doi.org/10.1007/978-3-030-23679-3_2
State	Published - 1 Jul 2019
Event	24th International Conference on Implementation and Application of Automata, CIAA 2019 - Košice, Slovakia Duration: 22 Jul 2019 → 25 Jul 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11601 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	24th International Conference on Implementation and Application of Automata, CIAA 2019
Country/Territory	Slovakia
City	Košice
Period	22/07/19 → 25/07/19

Scopus subject areas

Theoretical Computer Science
Computer Science(all)

ID: 43985829