Reset Complexity of Ideal Languages Over a Binary Alphabet - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Reset Complexity of Ideal Languages Over a Binary Alphabet

Marina Maslennikova
  • Function : Author
  • PersonId : 1024580

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.
Fichier principal
Vignette du fichier
440206_1_En_21_Chapter.pdf (153.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01656997 , version 1 (06-12-2017)

Licence

Attribution

Identifiers

Cite

Marina Maslennikova. Reset Complexity of Ideal Languages Over a Binary Alphabet. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.262-273, ⟨10.1007/978-3-319-60252-3_21⟩. ⟨hal-01656997⟩
28 View
32 Download

Altmetric

Share

Gmail Facebook X LinkedIn More