Abstract
Nondeterministic finite automata with don’t care states, namely states which neither accept nor reject, are considered. A characterization of deterministic automata compatible with such a device is obtained. Furthermore, an optimal state bound for the smallest compatible deterministic automata is provided. Finally, it is proved that the problem of minimizing nondeterministic and deterministic don’t care automata is NP-complete.
Cite
CITATION STYLE
Moreira, N., Pighizzini, G., & Reis, R. (2015). Optimal state reductions of automata with partially specified behaviors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8939, pp. 339–351). Springer Verlag. https://doi.org/10.1007/978-3-662-46078-8_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
