Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs
Formal Languages and Automata Theory
2022-12-06 v1
Abstract
This paper proves the decidability of the emptiness problem for two models which recognize graphs: graph-walking automata, and tilings of graphs by star subgraphs (star automata). Furthermore, it is proved that the non-emptiness problem for graph-walking automata (that is, whether a given automaton accepts at least one graph) is NEXP-complete. For star automata, which generalize nondeterministic tree automata to the case of graphs, it is proved that their non-emptiness problem is NP-complete.
Keywords
Cite
@article{arxiv.2212.02380,
title = {Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs},
author = {Olga Martynova},
journal= {arXiv preprint arXiv:2212.02380},
year = {2022}
}
Comments
29 pages, 4 figures