Reversibility of computations in graph-walking automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F20%3A00114625" target="_blank" >RIV/00216224:14310/20:00114625 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.ic.2020.104631" target="_blank" >https://doi.org/10.1016/j.ic.2020.104631</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ic.2020.104631" target="_blank" >10.1016/j.ic.2020.104631</a>
Alternative languages
Result language
angličtina
Original language name
Reversibility of computations in graph-walking automata
Original language description
Graph-walking automata (GWA) are finite-state devices that traverse graphs given as an input by following their edges; they have been studied both as a theoretical notion and as a model of pathfinding in robotics. If a graph is regarded as the set of memory configurations of a certain abstract machine, then various families of devices can be described as GWA: such are two-way finite automata, their multi-head and multi-tape variants, tree-walking automata and their extension with pebbles, picture-walking automata, space-bounded Turing machines, etc. This paper defines a transformation of an arbitrary deterministic GWA to a reversible GWA. This is done with a linear blow-up in the number of states, where the constant factor depends on the degree of the graphs being traversed. The construction directly applies to all basic models representable as GWA, and, in particular, subsumes numerous existing results for making individual models halt on every input. (C) 2020 Elsevier Inc. All rights reserved.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Information and computation
ISSN
0890-5401
e-ISSN
1090-2651
Volume of the periodical
275
Issue of the periodical within the volume
December 2020
Country of publishing house
US - UNITED STATES
Number of pages
32
Pages from-to
1-32
UT code for WoS article
000595367200029
EID of the result in the Scopus database
2-s2.0-85092724813