Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/101934
Title: A Characterization of Completely Reachable Automata
Authors: Bondar, E. A.
Volkov, M. V.
Issue Date: 2018
Publisher: Springer Verlag
Citation: Bondar E. A. A Characterization of Completely Reachable Automata / E. A. Bondar, M. V. Volkov. — DOI 10.1007/978-3-319-98654-8_12 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2018. — Vol. 11088 LNCS. — P. 145-155.
Abstract: A complete deterministic finite automaton 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 is called completely reachable. We characterize completely reachable automata in terms of certain directed graphs. © 2018, Springer Nature Switzerland AG.
Keywords: COMPLETE REACHABILITY
DETERMINISTIC FINITE AUTOMATON
DIRECTED GRAPHS
DETERMINISTIC FINITE AUTOMATA
REACHABILITY
STATE-SETS
AUTOMATA THEORY
URI: http://hdl.handle.net/10995/101934
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 85053869629
PURE ID: 7898495
3fc8653e-9592-4626-9bc3-5f3e03dd3578
ISSN: 3029743
ISBN: 9783319986531
DOI: 10.1007/978-3-319-98654-8_12
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-85053869629.pdf153,75 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.