Completely reachable automata: an interplay between automata, graphs, and trees
Formal Languages and Automata Theory
2022-01-14 v1
Abstract
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs and trees.
Keywords
Cite
@article{arxiv.2201.05075,
title = {Completely reachable automata: an interplay between automata, graphs, and trees},
author = {Evgeniya A. Bondar and David Casas and Mikhail V. Volkov},
journal= {arXiv preprint arXiv:2201.05075},
year = {2022}
}
Comments
29 pages, 16 figures