Abstract
When using string-rewriting systems in the context of formal languages, one of the most common questions is whether they preserve regularity. A class of string-rewriting systems that has received attention lately are idempotency relations. They were mainly used to generate languages starting from a single word.
Here we apply these relations to entire languages and investigate whether they preserve regularity. For this, it turns out to be convenient to define two more general classes of string-rewriting systems, the k-period expanding and the k-period reducing ones. We show that both preserve regularity. This implies regularity preservation for many classes of idempotency relations.
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
Book, R., Otto, F.: String-Rewriting Systems. Springer, Berlin (1993)
Bovet, D.P., Varricchio, S.: On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems. Information Processing Letters 44, 119–123 (1992)
Dassow, J., Mitranaand, V., Păun, G.: On the Regularity of Duplication Closure. Bull. EATCS 69, 133–136 (1999)
Ehrenfeucht, A., Rozenberg, G.: On Regularity of Languages Generated by Copying Systems. Discrete Applied Mathematics 8, 313–317 (1984)
Hofbauer, D., Waldmann, J.: Deleting String-Rewriting Systems preserve regularity. In: Theoretical Computer Science, vol. 327, pp. 301–317 (2004)
Ito, M.: Algebraic Theory of Automata and Languages. World Scientific, New Jersey (2004)
Ito, M., Leupold, P., Shikishima-Tsuji, K.: Closure of Language Classes under Bounded Duplication. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 238–247. Springer, Heidelberg (2006)
Leupold, P.: Languages Generated by Iterated Idempotencies. Theoretical Computer Science 370(1-3), 170–185 (2007)
Leupold, P.: General Idempotency Languages over Small Alphabets. Journal of Automata, Languages and Combinatorics (accepted for publication)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leupold, P. (2008). On Regularity-Preservation by String-Rewriting Systems. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-88282-4_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88281-7
Online ISBN: 978-3-540-88282-4
eBook Packages: Computer ScienceComputer Science (R0)