Skip to main content
SpringerLink
Log in

On the Power of Permitting Semi-conditional Grammars

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2017)

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

Included in the following conference series:

Abstract

Permitting semi-conditional grammars are such extensions of context-free grammars where each rule is associated with a word v, and such a rule can be applied to a sentential form u only if v is a subword of u. In this paper we show that the class of languages generated by permitting semi-conditional grammars with no erasing rules is strictly included in the class of context-sensitive languages.

This research was supported by a research grant from the Faculty of Informatics, Eötvös Loránd University.

Z. Gazdag—Research of this author was partially supported by the Hungarian National Research, Development and Innovation Office (NKFIH) under grant K 108448.

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 EPUB and 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

References

  1. Bordihn, H., Fernau, H.: Accepting grammars and systems: an overview. In: Developments in Language Theory, Magdeburg, Germany (1995)

    Google Scholar 

  2. Dassow, J., Masopust, T.: On restricted context-free grammars. J. Comput. Syst. Sci. 78(1), 293–304 (2012)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  4. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with \(n\) distinct prime factors. Am. J. Math. 35(4), 413–422 (1913)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ewert, S., van der Walt, A.: A shrinking lemma for random forbidding context languages. Theor. Comput. Sci. 237(1–2), 149–158 (2000)

    MathSciNet  MATH  Google Scholar 

  6. Ewert, S., van der Walt, A.: A pumping lemma for random permitting context languages. Theor. Comput. Sci. 270(1–2), 959–967 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gazdag, Z.: A note on context-free grammars with rewriting restrictions. In: Brodnik, A., Galambos, G. (eds.) Proceedings of the 2010 Mini-Conference on Applied Theoretical Computer Science. University of Primorska Press, Koper (2011)

    Google Scholar 

  8. Gazdag, Z.: Remarks on some simple variants of random context grammars. J. Autom. Lang. Comb. 19(1–4), 81–92 (2014)

    MathSciNet  MATH  Google Scholar 

  9. Gazdag, Z., Tichler, K.: On the power of permitting semi-conditional grammars, extended version. https://www.researchgate.net/publication/312587701_On_the_Power_of_Permitting_Semi-conditional_Grammars

  10. Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 3(1), 326–336 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  11. Joshi, A.K.: Tree adjoining grammars: how much context-sensitivity is required to provide reasonable structural descriptions? In: Dowty, D.R., Karttunen, L., Zwicky, A.M. (eds.) Natural Language Parsing, pp. 206–250. Cambridge University Press, Cambridge (1985)

    Chapter  Google Scholar 

  12. Jurafsky, D., Martin, J.H.: Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition. Prentice Hall PTR, Upper Saddle River, NJ, USA (2000)

    Google Scholar 

  13. Kelemen, J.: Conditional grammars: motivations, definitions, and some properties. In: Proceedings of the Conference on Automata, Languages and Mathematical Sciences, Salgótarján, pp. 110–123 (1984)

    Google Scholar 

  14. Kruskal, J.B.: Well-quasi-ordering, the tree theorem, and Vazsonyi’s conjecture. Trans. Am. Math. Soc. 95(2), 210–225 (1960)

    MathSciNet  MATH  Google Scholar 

  15. Masopust, T.: Simple restriction in context-free rewriting. J. Comput. Syst. Sci. 76(8), 837–846 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  16. Păun, G.: A variant of random context grammars: semi-conditional grammars. Theor. Comput. Sci. 41, 1–17 (1985)

    Article  MATH  Google Scholar 

  17. Salomaa, A.: Formal Languages. Academic Press, New York, London (1973)

    MATH  Google Scholar 

  18. van der Walt, A.: Random context languages. Inf. Process. 71, 66–68 (1972)

    MathSciNet  MATH  Google Scholar 

  19. Zetzsche, G.: On erasing productions in random context grammars. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 175–186. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14162-1_15

    Chapter  Google Scholar 

Download references

Acknowledgement

We are grateful to Erzsébet Csuhaj Varjú for introducing us the topic of this paper and also for her many useful comments on it. We thank the anonymous reviewers for their constructive comments, which helped us to improve the manuscript.

Author information

Authors and Affiliations

  1. Department of Foundations of Computer Science, University of Szeged, Szeged, Hungary

    Zsolt Gazdag

  2. Department of Algorithms and Their Applications, Eötvös Loránd University, Budapest, Hungary

    Krisztián Tichler

Authors
  1. Zsolt Gazdag
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krisztián Tichler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zsolt Gazdag .

Editor information

Editors and Affiliations

  1. Université de Liège, Liège, Belgium

    Émilie Charlier

  2. Université de Liège, Liège, Belgium

    Julien Leroy

  3. Université de Liège, Liège, Belgium

    Michel Rigo

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Gazdag, Z., Tichler, K. (2017). On the Power of Permitting Semi-conditional Grammars. In: Charlier, É., Leroy, J., Rigo, M. (eds) Developments in Language Theory. DLT 2017. Lecture Notes in Computer Science(), vol 10396. Springer, Cham. https://doi.org/10.1007/978-3-319-62809-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-62809-7_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-62808-0

  • Online ISBN: 978-3-319-62809-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation