Abstract : We present a few results and several open problems concerning complete deterministic finite automata 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.
Cezar Câmpeanu; Florin Manea; Jeffrey Shallit. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9777, pp.1-17, 2016, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-41114-9_1〉
https://hal.inria.fr/hal-01633948
Contributeur : Hal Ifip
<>
Soumis le : lundi 13 novembre 2017 - 15:32:32
Dernière modification le : lundi 13 novembre 2017 - 15:35:36
Document(s) archivé(s) le : mercredi 14 février 2018 - 15:13:24
