Skip to main content
SpringerLink
Log in

On Grammars Controlled by Parikh Vectors

  • Chapter
Languages Alive

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7300))

  • 411 Accesses

Abstract

We suggest a concept of grammars with controlled derivations where the Parikh vectors of all intermediate sentential forms have to be from a given restricting set. For several classes of restricting sets, we investigate set-theoretic and closure properties of the corresponding language families.

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. Berstel, J.: Transductions and Context-Free Languages. Teubner-Verlag, Stuttgart (1979)

    Book  MATH  Google Scholar 

  2. Brainerd, B.: An analog of a theorem about context-free languages. Information and Control 11, 561–567 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer (1989)

    Google Scholar 

  4. Ginsburg, S., Spanier, E.: Derivation bounded languages. Journal of Computer and System Sciences 2, 228–250 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  5. Greibach, S.: Full AFLs and nested iterated substitution. Information and Control 16(1), 7–35 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  6. Greibach, S.: A generalization of Parikh’s semilinear theorem. Discrete Mathematics 2, 347–355 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  8. Stiebe, R.: Positive valence grammars. In: Csuhaj-Varjú, E., Kintala, C., Wotschke, D., Vaszil, G. (eds.) Fifth International Workshop Descriptional Complexity of Formal Systems, pp. 186–197. MTA SZTAKI, Budapest (2003)

    Google Scholar 

  9. Stiebe, R., Turaev, S.: Capacity bounded grammars. Journal of Automata, Languages and Combinatorics 15, 175–194 (2010)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, Postfach 4120, 39106, Magdeburg, Germany

    Ralf Stiebe

Authors
  1. Ralf Stiebe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Potsdam, August-Bebel-Straße 89, 14482, Potsdam, Germany

    Henning Bordihn

  2. Institut für Informatik, Universität Giessen, Arndtstraße 2, 35392, Giessen, Germany

    Martin Kutrib

  3. Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39016, Magdeburg, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Stiebe, R. (2012). On Grammars Controlled by Parikh Vectors. In: Bordihn, H., Kutrib, M., Truthe, B. (eds) Languages Alive. Lecture Notes in Computer Science, vol 7300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31644-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31644-9_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31643-2

  • Online ISBN: 978-3-642-31644-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation