Skip to main content
SpringerLink
Log in

Parikh Mapping and Iteration

  • Conference paper
  • First Online:
Multiset Processing (WMC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2235))

Included in the following conference series:

Abstract

The Parikh mapping maps each word over an alphabet with n letters to an n-dimensional vector whose components give the number of occurrences of the letters in the word.We consider the Parikh images of sequences and languages obtained by iterated applications of morphisms (or sets of substitutions). Furthermore we modify the Parikh mapping such that it can be iterated and study the corresponding sequences.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. König, Theorie der endlichen und unendlichen Graphen. Chelsea, New York, 1959.

    Google Scholar 

  2. J. Dassow, On Parikh-languages of L systems without interaction. Rostock. Math. Colloq. 15 (1980) 103–110.

    MATH  MathSciNet  Google Scholar 

  3. J. Dassow, S. Marcus and Gh. Păun, Iterative reading of numbers and “black holes”. Periodica Math. Hungarica 27 (1993) 137–152.

    Article  MATH  Google Scholar 

  4. J. Dassow, S. Marcus and Gh. Păun, Iterative reading of numbers: the ordered case. In: G. Rozenberg and A. Salomaa, Developments in Language Theory, World Scientific, Singapore, 1994, 157–168.

    Google Scholar 

  5. S. Ginsburg, The Mathematical Theory of Context-Free Languages. McGrw Hill Book Co., New York, 1966.

    Google Scholar 

  6. S. Ginsburg and E.H. Spanier, Bounded ALGOL-like languages. ???

    Google Scholar 

  7. E.M. Gurari and O.H. Ibarra, The complexity of the equivalence problem for counter languages, semilinear sets, and simple programs. In: Conference Record Tenth Annual ACM Symposium Theory of Computing, Atlanta, 1979, 142–152.

    Google Scholar 

  8. G.T. Herman and G. Rozenberg, Developmental Systems and Languages, North-Holland, 1974.

    Google Scholar 

  9. M. Nielsen, On the decidability of some equivalence problems for D0L systems. Inform. Control 25 (1974) 166–193.

    Article  MATH  Google Scholar 

  10. R.J. Parikh, On context-free languages.Journal of the ACM 13 (1966) 570–581.

    Article  MATH  MathSciNet  Google Scholar 

  11. G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems. Academic Press, 1980.

    Google Scholar 

  12. A. Salomaa, Formal Languages. Academic Press, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, PSF 4120, D-39016, Magdeburg

    Jürgen Dassow

Authors
  1. Jürgen Dassow
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science Center for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland

    Cristian S. Calude

  2. Institute of Mathematics of the Romanian Academy, Romanian

    Gheorghe PĂun

  3. Leiden Institute for Advanced Computer Science, Leiden University, Leiden

    Grzegorz Rozenberg

  4. Turku Center for Computer Science, TUCS, Turku

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dassow, J. (2001). Parikh Mapping and Iteration. In: Calude, C.S., PĂun, G., Rozenberg, G., Salomaa, A. (eds) Multiset Processing. WMC 2000. Lecture Notes in Computer Science, vol 2235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45523-X_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45523-X_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43063-6

  • Online ISBN: 978-3-540-45523-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation