HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-01633948
Contributor : Hal Ifip Connect in order to contact the contributor
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

Identifiers

Citation

Eugenija Bondar, Mikhail Volkov. Completely Reachable Automata. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.1-17, ⟨10.1007/978-3-319-41114-9_1⟩. ⟨hal-01633948⟩

Share

Metrics

Record views

30

Files downloads

127