Abstract
We introduce a new model of weighted automata: the desert automata. We show that their limitedness problem is PSPACE-complete by solving the underlying Burnside problem. As an application of this result, we give a positive solution to the so-called finite substitution problem which was open for more than 10 years: given recognizable languages K and L, decide whether there exists a finite substitution σ such that σ(K) = L.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kirsten, D. A Burnside Approach to the Finite Substitution Problem. Theory Comput Syst 39, 15–50 (2006). https://doi.org/10.1007/s00224-005-1255-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-005-1255-x