%0 Conference Proceedings
%T Reset Complexity of Ideal Languages Over a Binary Alphabet
%+ Ural Federal University [Ekaterinburg] (UrFU)
%A Maslennikova, Marina
%Z Part 2: Contributed Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Milano, Italy
%Y Giovanni Pighizzini
%Y Cezar Câmpeanu
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-10316
%P 262-273
%8 2017-07-03
%D 2017
%R 10.1007/978-3-319-60252-3_21
%K Ideal language
%K Synchronizing automaton
%K Reset word
%K Reset complexity
%K PSPACE-completeness
%Z Computer Science [cs]Conference papers
%X We prove PSPACE-completeness of checking whether a given ideal language serves as the language of reset words for some automaton with at most four states over a binary alphabet.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01656997/document
%2 https://inria.hal.science/hal-01656997/file/440206_1_En_21_Chapter.pdf
%L hal-01656997
%U https://inria.hal.science/hal-01656997
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-10316