| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Completely Reachable Automata
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.
Cited literature [5 references]
https://hal.inria.fr/hal-01633948
Contributor : Hal Ifip <>
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
Contributor : Hal Ifip <>
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
File
416473_1_En_1_Chapter.pdf
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License