Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Homomorphisms on Graph-Walking Automata. / Martynova, Olga; Okhotin, Alexander.
Implementation and Application of Automata - 26th International Conference, CIAA 2022, Proceedings. ed. / Pascal Caron; Ludovic Mignot. Springer Nature, 2022. p. 177-188 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13266 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Homomorphisms on Graph-Walking Automata
AU - Martynova, Olga
AU - Okhotin, Alexander
N1 - Publisher Copyright: © 2022, Springer Nature Switzerland AG.
PY - 2022/6
Y1 - 2022/6
N2 - Graph-walking automata (GWA) analyze an input graph by moving between its nodes, following the edges. This paper investigates the effect of node-replacement graph homomorphisms on recognizability by these automata. The family of graph languages recognized by GWA is closed under inverse homomorphisms. The main result of this paper is that, for n-state automata operating on graphs with k labels of edge end-points, the inverse homomorphic images require GWA with kn+ O(1 ) states in the worst case. The second result is that already for tree-walking automata, the family they recognize is not closed under injective homomorphisms; here the proof is based on a homomorphic characterization of regular tree languages.
AB - Graph-walking automata (GWA) analyze an input graph by moving between its nodes, following the edges. This paper investigates the effect of node-replacement graph homomorphisms on recognizability by these automata. The family of graph languages recognized by GWA is closed under inverse homomorphisms. The main result of this paper is that, for n-state automata operating on graphs with k labels of edge end-points, the inverse homomorphic images require GWA with kn+ O(1 ) states in the worst case. The second result is that already for tree-walking automata, the family they recognize is not closed under injective homomorphisms; here the proof is based on a homomorphic characterization of regular tree languages.
UR - http://www.scopus.com/inward/record.url?scp=85131947794&partnerID=8YFLogxK
UR - https://www.mendeley.com/catalogue/6d5098cc-da51-3181-93ec-90f86b6115e4/
U2 - 10.1007/978-3-031-07469-1_14
DO - 10.1007/978-3-031-07469-1_14
M3 - Conference contribution
AN - SCOPUS:85131947794
SN - 9783031074684
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 177
EP - 188
BT - Implementation and Application of Automata - 26th International Conference, CIAA 2022, Proceedings
A2 - Caron, Pascal
A2 - Mignot, Ludovic
PB - Springer Nature
T2 - 26th International Conference on Implementation and Application of Automata, CIAA 2022
Y2 - 28 June 2022 through 1 July 2022
ER -
ID: 96946270