Skip to main content
Springer Nature Link
Log in

Scattered context grammars that erase nonterminals in a generalized k-limited way

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

A scattered context grammar erases nonterminals in a generalized k-limited way in a successful derivation, where k is a positive integer, if in every sentential form of a derivation, each of its substrings consisting of nonterminals from which the grammar derives empty strings is of length k or less. This paper demonstrates that if a scattered context grammar generates its sentences in this way, it can be converted to a scattered context grammar without erasing productions; in general, however, this is not possible.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Fernau H.: Scattered context grammars with regulation. Ann. Bucharest Univ. Math. Inform. Ser. 45(1), 41–49 (1996)

    MathSciNet  Google Scholar 

  2. Gonczarowski J., Warmuth M. K.: Scattered versus context-sensitive rewriting. Acta Inform. 27, 81–95 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. Greibach S., Hopcroft J.: Scattered context grammars. J. Comput. Syst. Sci. 3, 233–247 (1969)

    MATH  MathSciNet  Google Scholar 

  4. Masopust, T., Techet, J.: Leftmost derivations of propagating scattered context grammars: a new proof. Discrete Math. Theor. Comput. Sci. 3 (2008)

  5. Meduna A.: A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars. EATCS Bull. 56, 104–106 (1995)

    MATH  Google Scholar 

  6. Meduna, A.: Automata and Languages: Theory and Applications. Springer, Heidelberg (2000)

    Google Scholar 

  7. Meduna A., Techet J.: Canonical scattered context generators of sentences with their parses. Theor. Comput. Sci. 389, 73–81 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Meduna, A., Techet, J.: Maximal and minimal scattered context rewriting. In: FCT 2007 Proceedings, vol. 4639, pp. 412–423. Springer, Budapest (2007)

  9. Milgram D., Rosenfeld A.: A note on scattered context grammars. Inform. Process. Lett. 1, 47–50 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  10. Revesz, G.E.: Introduction to Formal Language Theory. McGraw-Hill, New York (1983)

    Google Scholar 

  11. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. Springer, Heidelberg (1997)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  13. Vaszil G.: On the descriptional complexity of some rewriting mechanisms regulated by context conditions. Theor. Comput. Sci. 330, 361–373 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  14. Virkkunen V.: On scattered context grammars. Acta Universitatis Ouluensis 20(6), 75–82 (1973)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems, Faculty of Information Technology, Brno University of Technology, Božetěchova 2, 61266, Brno, Czech Republic

    Alexander Meduna & Jiří Techet

Authors
  1. Alexander Meduna
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiří Techet
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Meduna.

Additional information

This work was supported by GAČR grants 201/07/0005, 102/05/H050, and Research Plan MSM 021630528.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meduna, A., Techet, J. Scattered context grammars that erase nonterminals in a generalized k-limited way. Acta Informatica 45, 593–608 (2008). https://doi.org/10.1007/s00236-008-0081-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-008-0081-4

Keywords