%0 Conference Proceedings
%T Completely Reachable Automata
%+ Ural Federal University [Ekaterinburg] (UrFU)
%A Bondar, Eugenija, A.
%A Volkov, Mikhail, V.
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
%C Bucharest, Romania
%Y Cezar Câmpeanu
%Y Florin Manea
%Y Jeffrey Shallit
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-9777
%P 1-17
%8 2016-07-05
%D 2016
%R 10.1007/978-3-319-41114-9_1
%K Deterministic finite automaton
%K Complete reachability
%K Transition monoid
%K Syntactic complexity
%K PSPACE-completeness
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01633948/document
%2 https://inria.hal.science/hal-01633948/file/416473_1_En_1_Chapter.pdf
%L hal-01633948
%U https://inria.hal.science/hal-01633948
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-LNCS-9777
%~ IFIP-WG1-2