On the transition reduction problem for finite automata
Formal Languages and Automata Theory
2013-01-17 v1 Combinatorics
Abstract
We are interested in the problem of transition reduction of nondeterministic automata. We present some results on the reduction of the automata recognizing the language denoted by the regular expression . These results can be used in the general case of the transition reduction problem.
Keywords
Cite
@article{arxiv.1301.3751,
title = {On the transition reduction problem for finite automata},
author = {el Houcein el Abdalaoui and Mohamed Dahmoune and Djelloul Ziadi},
journal= {arXiv preprint arXiv:1301.3751},
year = {2013}
}
Comments
22 pages, 7 figures, submitted; Keywords: language, automata, reduction, deterministic minimal automaton, state, regular expression, $Z$-partition, $P$-trees