Skip to main content
SpringerLink
Log in
Book cover

Languages Alive pp 160–173Cite as

One-Sided Random Context Grammars with Leftmost Derivations

  • Chapter

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

Abstract

In this paper, we study the generative power of one-sided random context grammars working in a leftmost way. More specifically, by analogy with the three well-known types of leftmost derivations in regulated grammars, we introduce three types of leftmost derivations to one-sided random context grammars and prove the following three results. (I) One-sided random context grammars with type-1 leftmost derivations characterize the family of context-free languages. (II) One-sided random context grammars with type-2 and type-3 leftmost derivations characterize the family of recursively enumerable languages. (III) Propagating one-sided random context grammars with type-2 and type-3 leftmost derivations characterize the family of context-sensitive languages. In the conclusion, the generative power of random context grammars and one-sided random context grammars with leftmost derivations is compared.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison-Wesley, Boston (2006)

    MATH  Google Scholar 

  2. Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation and Compiling. Parsing, vol. I. Prentice-Hall, New Jersey (1972)

    MATH  Google Scholar 

  3. Baker, B.S.: Non-context-free grammars generating context-free languages. Information and Control 24(3), 231–246 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cannon, R.L.: Phrase structure grammars generating context-free languages. Information and Control 29(3), 252–267 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cojocaru, L., Mäkinen, E.: On the complexity of Szilard languages of regulated grammars. Tech. rep., Department of Computer Sciences, University of Tampere, Tampere, Finland (2010)

    Google Scholar 

  6. Cremers, A.B., Maurer, H.A., Mayer, O.: A note on leftmost restricted random context grammars. Information Processing Letters 2(2), 31–33 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cytron, R., Fischer, C., LeBlanc, R.: Crafting a Compiler. Addison-Wesley, Boston (2009)

    Google Scholar 

  8. Dassow, J., Fernau, H., Păun, G.: On the leftmost derivation in matrix grammars. International Journal of Foundations of Computer Science 10(1), 61–80 (1999)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  10. Fernau, H.: Regulated grammars under leftmost derivation. Grammars 3(1), 37–62 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fernau, H.: Nonterminal complexity of programmed grammars. Theoretical Computer Science 296(2), 225–251 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  12. Ferretti, C., Mauri, G., Păun, G., Zandron, C.: On three variants of rewriting P systems. Theoretical Computer Science 301(1-3), 201–215 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Freund, R., Oswald, M.: P Systems with Activated/Prohibited Membrane Channels. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 261–269. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Ginsburg, S., Spanier, E.H.: Control sets on grammars. Theory of Computing Systems 2(2), 159–177 (1968)

    MathSciNet  MATH  Google Scholar 

  15. Kasai, T.: An hierarchy between context-free and context-sensitive languages. Journal of Computer and System Sciences 4, 492–508 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lukáš, R., Meduna, A.: Multigenerative grammar systems. Schedae Informaticae 2006(15), 175–188 (2006)

    MATH  Google Scholar 

  17. Luker, M.: A generalization of leftmost derivations. Theory of Computing Systems 11(1), 317–325 (1977)

    MathSciNet  MATH  Google Scholar 

  18. Matthews, G.H.: A note on asymmetry in phrase structure grammars. Information and Control 7, 360–365 (1964)

    Article  MATH  Google Scholar 

  19. Maurer, H.: Simple matrix languages with a leftmost restriction. Information and Control 23(2), 128–139 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  20. Meduna, A.: On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 27–38. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  21. Meduna, A.: Elements of Compiler Design. Auerbach Publications, Boston (2007)

    MATH  Google Scholar 

  22. Meduna, A., Goldefus, F.: Weak leftmost derivations in cooperative distributed grammar systems. In: MEMICS 2009: 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, pp. 144–151. Brno University of Technology, Brno (2009)

    Google Scholar 

  23. Meduna, A., Techet, J.: Canonical scattered context generators of sentences with their parses. Theoretical Computer Science 2007(389), 73–81 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  24. Meduna, A., Techet, J.: Scattered Context Grammars and their Applications. WIT Press, Southampton (2010)

    MATH  Google Scholar 

  25. Meduna, A., Škrkal, O.: Combined leftmost derivations in matrix grammars. In: ISIM 2004: Proceedings of 7th International Conference on Information Systems Implementation and Modelling, Ostrava, CZ, pp. 127–132 (2004)

    Google Scholar 

  26. Meduna, A., Zemek, P.: Nonterminal complexity of one-sided random context grammars. Acta Informatica 49(2), 55–68 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  27. Meduna, A., Zemek, P.: One-sided random context grammars. Acta Informatica 48(3), 149–163 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  28. Mihalache, V.: Matrix grammars versus parallel communicating grammar systems. In: Mathematical Aspects of Natural and Formal Languages, pp. 293–318. World Scientific Publishing, River Edge (1994)

    Chapter  Google Scholar 

  29. Mutyam, M., Krithivasan, K.: Tissue P systems with leftmost derivation. Ramanujan Mathematical Society Lecture Notes Series 3, 187–196 (2007)

    MathSciNet  MATH  Google Scholar 

  30. Păun, G.: On leftmost derivation restriction in regulated rewriting. Romanian Journal of Pure and Applied Mathematics 30(9), 751–758 (1985)

    MathSciNet  MATH  Google Scholar 

  31. Rosenkrantz, D.J.: Programmed grammars and classes of formal languages. Journal of the ACM 16(1), 107–131 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  32. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1 through 3. Springer, Berlin (1997)

    Google Scholar 

  33. Salomaa, A.: Matrix grammars with a leftmost restriction. Information and Control 20(2), 143–149 (1972)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Technology, IT4Innovations Centre of Excellence, Brno University of Technology, Božetěchova 1/2, 612 66, Brno, Czech Republic

    Alexander Meduna & Petr Zemek

Authors
  1. Alexander Meduna
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petr Zemek
    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

Meduna, A., Zemek, P. (2012). One-Sided Random Context Grammars with Leftmost Derivations. 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_11

Download citation

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

  • 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