Abstract
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.
Supported by the grant KI 822/1–1 of the German Research Community (DFG). On leave from Institute of Algebra, Dresden University of Technology, Germany.
See www.math.tu-dresden.de/ kirsten for a complete version [4].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hashiguchi, K.: Limitedness theorem on finite automata with distance functions. Journal of Computer and System Sciences 24, 233–244 (1982)
Hashiguchi, K.: Regular languages of star height one. Information and Control 53, 199–210 (1982)
Hashiguchi, K.: New upper bounds to the limitedness of distance automata. Theoretical Computer Science 233, 19–32 (2000)
Kirsten, D.: Desert automata I. A Burnside problem and its solution. LIAFA Technical Report 2003-020, Paris (2003)
Kirsten, D.: Distance desert automata and the star height one problem. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 257–272. Springer, Heidelberg (2004) (to appear)
Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Int. J. of Algebra and Computation 4(3), 405–425 (1994)
Leung, H.: An Algebraic Method for Solving Decision Problems in Finite Automata Theory. PhD thesis, Pennsylvania State Univ., Dep. of Computer Science (1987)
Leung, H.: The topological approach to the limitedness problem on distance automata. In: Gunawardena, J. (ed.) Idempotency, pp. 88–111. Cambridge Univ., Cambridge (1998)
Leung, H., Podolskiy, V.: The limitedness problem on distance automata: Hashiguchi’s method revisited. Theor. Comp. Science 310(1-3), 147–158 (2004)
Pin, J.-E.: Varieties of Formal Languages. North Oxford Academic Publ. (1986)
Pin, J.-E.: Personal communication (2003)
Simon, I.: Limited subsets of a free monoid. In: Proceedings of the 19th IEEE Annual Symposium on Foundations of Computer Science, pp. 143–150 (1978)
Simon, I.: On semigroups of matrices over the tropical semiring. Informatique Théorique et Applications 28, 277–294 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirsten, D. (2004). Desert Automata and the Finite Substitution Problem. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive