Abstract
A reduction system for regular expressions is presented. For a regular expression t, the reduction system is proved to terminate in a state where the most-reduced expression readily yields a semi-linear representation for the Parikh image of the language of t.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aceto, L., Ésik, Z., Ingólfsdóttir, A.: A fully equational proof of Parikh’s theorem. ITA 36(2), 129–153 (2002)
Blattner, M., Latteux, M.: Parikh-bounded languages. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 316–323. Springer, Heidelberg (1981)
Delgado, M.: Commutative images of rational languages and the Abelian kernel of a monoid. ITA 35(5), 419–435 (2001)
Goldstine, J.: A simplified proof of Parikh’s theorem. Discrete Math. 19, 235–239 (1977)
Ibarra, O., Kim, C.: A useful device for showing the solvability of some decision problems. In: STOC 1976, pp. 135–140. ACM, New York (1976)
Parikh, R.: On context-free languages. J. ACM 13(4), 570–581 (1966)
Pilling, D.: Commutative regular equations and Parikh’s theorem. J. London Math. Soc. 6, 633–666 (1973)
Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)
Verma, K.N., Seidl, H., Schwentick, T.: On the complexity of equational Horn clauses. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 337–352. Springer, Heidelberg (2005)
Xie, G., Li, C., Deng, Z.: Linear reachability problems and minimal solutions to linear Diophantine equation systems. TCS 328, 203–219 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Badban, B., Torabi Dashti, M. (2010). Semi-linear Parikh Images of Regular Expressions via Reduction. In: Hliněný, P., Kučera, A. (eds) Mathematical Foundations of Computer Science 2010. MFCS 2010. Lecture Notes in Computer Science, vol 6281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15155-2_57
Download citation
DOI: https://doi.org/10.1007/978-3-642-15155-2_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15154-5
Online ISBN: 978-3-642-15155-2
eBook Packages: Computer ScienceComputer Science (R0)