Desert Automata and the Finite Substitution Problem

d Abstract)⋆⋆ Daniel Kirsten LIAFA, Universit´e Denis Diderot – Case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France We give a positive solution to the so-called finite substitution problem which was open for more than 10 years [11]: given recognizable languages K and L, decide whether there exists a finite substitution σ such that σ(K) = L. For this, we introduce a new model of weighted automata and show the decidability of its limitedness problem by solving the underlying Burnside problem.

• Type: Conference
• Year: 2004
• Where: STACS
• Authors: Daniel Kirsten
• Keywords: STACS 2004, Theoretical Computer Science, Universit´e Denis Diderot, finite Substitution, finite Substitution Problem