Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata

@article{Sawa2013EfficientCO,
title={Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata},
author={Zdenek Sawa},
journal={Fundam. Inform.},
year={2013},
volume={123},
pages={97-106}
}

In languages over a unary alphabet, i.e., an alphabet with only one letter, words can be identified with their lengths. It is well known that each regular language over a unary alphabet can be represented as the union of a finite number of arithmetic progressions. Given a nondeterministic finite automaton (NFA) working over a unary alphabet (a unary NFA), the arithmetic progressions representing the language accepted by the automaton can be easily computed by the determinization of the given… CONTINUE READING