Abstract
AbstractWe 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
