Skip to main content
Conference ProceedingsOPEN ACCESS

Completely reachable automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9777 1-17
DOI: 10.1007/978-3-319-41114-9_1
17Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Bondar, E. A., & Volkov, M. V. (2016). Completely reachable automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9777, pp. 1–17). Springer Verlag. https://doi.org/10.1007/978-3-319-41114-9_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free