Reset Complexity of Ideal Languages Over a Binary Alphabet
Work
Year: 2019
Type: article
Abstract: 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. We compare the reset c... more
Author Marina Maslennikova
Institution Ural Federal University
Cites: 17
Cited by: 13
Related to: 10
FWCI: 1.483
Citation percentile (by year/subfield): 70.46
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Quality education
Open Access status: green
Grant ID 1.3253.2017