| Descriptional Complexity of Formal Systems 18th IFIP WG 1.2 International Conference, DCFS 2016 Bucharest, Romania, July 5–8, 2016 |
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.
| Origin | Files produced by the author(s) |
|---|
Connect in order to contact the contributor
https://inria.hal.science/hal-01633948
Submitted on : Monday, November 13, 2017-3:32:32 PM
Last modification on : Monday, November 13, 2017-3:35:36 PM
Long-term archiving on : Wednesday, February 14, 2018-3:13:24 PM
