A Characterization of Completely Reachable Automata
Formal Languages and Automata Theory
2018-05-09 v1
Abstract
A complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize completely reachable automata in terms of certain directed graphs.
Keywords
Cite
@article{arxiv.1805.02879,
title = {A Characterization of Completely Reachable Automata},
author = {Eugenija Bondar and Mikhail Volkov},
journal= {arXiv preprint arXiv:1805.02879},
year = {2018}
}
Comments
12 pages, 3 figures, submitted to DLT 2018