Abstract
This paper contains algebraic aspects of Parikh matrices. We present new, but also some old results, concerning this topic. It is proved that in some cases the set of Parikh matrices is a noncommutative semiring with a unit element. Also we prove that the set of Parikh matrices is closed under the operation of shuffle on trajectories and thus it is closed under many other operations. It is presented also the notion of extended Parikh matrix that it is an extension of the notion of the Parikh matrix. The paper contains also a number of open problems.
This is a preview of subscription content, log in via an institution to check access.
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
Atanasiu, A., MartÃn-Vide, C., Mateescu, A.: On the injectivity of the Parikh matrix mapping. Submitted for publication (2000)
Harju, T., Ibarra, O., Karhumäki, J., Salomaa, A.: Some decision problems concerning semilinearity and commutation. To appear in J. Comput. System Sci (2002)
Honkala, J.: On slender languages. EATCS Bulletin 64, 145–152 (1998)
Honkala, J.: On Parikh slender languages and power series. J. Comput. System Sci. 52, 185–190 (1996)
Ilie, L., Rozenberg, G., Salomaa, A.: A characterization of poly-slender context-free languages. Theor. Inform. Appl. 34, 77–86 (2000)
Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: A Sharpening of the Parikh Mapping. RAIRO - Theoretical Informatics and Applications 35, 551–564 (2001)
Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: On an extension of the Parikh mapping, TUCS Technical Report No 364
Mateescu, A., Salomaa, A., Yu, S.: Subword Histories and Parikh Matrices, TUCS Technical Report No 442 (February 2002)
Mateescu, G.: Shuffle on Trajectories: Syntactic Constraints. Theoretical Computer Science, TCS, Fundamental Study 197(1-2), 1–56 (1998)
Pansiot, J.J.: A decidable property of iterated morphisms. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 152–158. Springer, Heidelberg (1981)
Parikh, R.J.: On context-free languages. J. Assoc. Comput. Mach. 13, 570–581 (1966)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages 1-3. Springer, Heidelberg (1997)
Sakarovitch, J., Simon, I.: Subwords. In: M. Lothaire: Combinatorics on Words, pp. 105–142. Addison-Wesley, Reading (1983)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Sȩrbănuţă, T.-F.: Extending Parikh Matrices Theoretical Computer Science (January 2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mateescu, A. (2004). Algebraic Aspects of Parikh Matrices. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds) Theory Is Forever. Lecture Notes in Computer Science, vol 3113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27812-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-27812-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22393-1
Online ISBN: 978-3-540-27812-2
eBook Packages: Springer Book Archive