Graph-based automata

@misc{pujol2026graphbased,
  title = {{Graph-based automata}},
  author = {Cyril Pujol},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.08843},
  eprint = {2609.08843},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.08843},
  note = {CC BY 4.0},
}

TY  - UNPB
TI  - Graph-based automata
AU  - Cyril Pujol
PY  - 2026
DA  - 2026/09/08
PB  - arXiv
DO  - 10.48550/arxiv.2609.08843
UR  - https://arxiv.org/abs/2609.08843
AB  - We study graph-based automata: nondeterministic finite automata obtained from edge-colored or oriented graphs by taking every vertex as both initial and accepting, and every edge as a pair of opposite transitions. The language of these automata corresponds to the set of edge-colored or oriented paths mapping to their corresponding graphs. We develop an analogous notion for trees and characterise the languages recognised by these models. For tree languages we prove the existence of a unique size- minimal graph and, more generally, a homomorphism-minimal graph for both word and tree languages using duality methods. In order to further motivate these models, we showcase a few results at the inter- section between graph theory and automata theory: We relate graph-based automata to reversible automata, give a decomposition of graph-based languages into reversible languages, and introduce the remanent language of an undirected graph as the inter- section of all its orientations. This remanent language captures structural information on the graph such as chromatic number.
ER  -