ON THE REGULARITY OF SETS OF MULTI-ACCEPTED STRINGS OF A NON-DETERMINISTIC FINITE AUTOMATON
L. K. Waters, Justin Grieshop · Asian-European Journal of Mathematics · 2009
In this paper we establish the regularity of various sets of multi-accepted strings of nondeterministic finite automata. Regularity follows from the existence of accepting automata constructed by introducing a vector labeling method which generalizes the subset labeling approach. In each set the acceptance levels of the strings correspond to finite sets of additive equivalence classes of non-negative integers.