Completely reachable automata

Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/102232

Title:	Completely reachable automata
Authors:	Bondar, E. A. Volkov, M. V.
Issue Date:	2016
Publisher:	Springer Verlag
Citation:	Bondar E. A. Completely reachable automata / E. A. Bondar, M. V. Volkov. — DOI 10.1007/978-3-319-41114-9_1 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2016. — Vol. 9777. — P. 1-17.
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. © IFIP International Federation for Information Processing 2016.
Keywords:	COMPLETE REACHABILITY DETERMINISTIC FINITE AUTOMATON PSPACE-COMPLETENESS SYNTACTIC COMPLEXITY TRANSITION MONOID ARTIFICIAL INTELLIGENCE COMPUTER SCIENCE COMPUTERS DETERMINISTIC FINITE AUTOMATA PSPACE COMPLETENESS REACHABILITY SYNTACTIC COMPLEXITY TRANSITION MONOID DISPERSION COMPENSATION
URI:	http://elar.urfu.ru/handle/10995/102232
Access:	info:eu-repo/semantics/openAccess
SCOPUS ID:	84978924306
PURE ID:	1059659 a4d8df1a-b54c-43e2-8ebb-ae9e085c209d
ISSN:	3029743
ISBN:	9783319411132
DOI:	10.1007/978-3-319-41114-9_1
Appears in Collections:	Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:

File	Description	Size	Format
2-s2.0-84978924306.pdf		233,32 kB	Adobe PDF	View/Open