Skip to main content
Conference Proceedings

Binary Completely Reachable Automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2022) 13568 LNCS 345-358
DOI: 10.1007/978-3-031-20624-5_21
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We characterize complete deterministic finite automata with two input letters in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word. The characterization leads to a polynomial-time algorithm for recognizing this class of automata.

Author supplied keywords

Cite

CITATION STYLE

APA

Casas, D., & Volkov, M. V. (2022). Binary Completely Reachable Automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13568 LNCS, pp. 345–358). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-20624-5_21

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