State complexity of transforming graph-walking automata to halting, returning and reversible

From MaRDI portal
Publication:2687992

DOI10.1016/J.IC.2023.105011zbMATH Open1506.68048OpenAlexW4319311375MaRDI QIDQ2687992FDOQ2687992


Authors: Olga Martynova, Alexander Okhotin Edit this on Wikidata


Publication date: 7 March 2023

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2023.105011




Recommendations




Cites Work


Cited In (6)





This page was built for publication: State complexity of transforming graph-walking automata to halting, returning and reversible

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2687992)