Skip to main content
SpringerLink
Log in

Scattered versus context-sensitive rewriting

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We study the relationship between scattered and context-sensitive rewriting. We prove that an extended version of scattered grammars produces exactly the context-sensitive languages. Also unordered scattered context languages are a proper subset of scattered context languages, and unordered scattered rewriting with erasing does not generate all scattered context (and thus not all context-sensitive) languages.

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

Access this article

Log in via an institution

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. Cremers, A.B.: Normal Forms for Context-Sensitive Grammars. Acta Inf. 3, 59–73 (1973)

    Google Scholar 

  2. Dahlhaus, E., Gaifman, H.: Concerning 2-Adjacent Context-Free Languages. Theor. Comput. Sci. 41, 169–184 (1985)

    Google Scholar 

  3. Dahlhaus, E., Warmuth, M.K.: Membership for Growing Context-Sensitive Languages is Polynomial. J. Comput. Syst. Sci. 33, 456–472 (1986)

    Google Scholar 

  4. Greibach, S., Hopcroft, J.: Scattered Context Grammars. J. Comput. Syst. Sci. 3, 233–247 (1969)

    Google Scholar 

  5. Gonczarowski, J., Shamir, E.: Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style. J. Comput. Syst. Sci. 30, 249–273 (1985)

    Google Scholar 

  6. Gonczarowski, J., Warmuth, M.K.: Applications of Scheduling Theory to Formal Language Theory. Theor. Comput. Sci. 37, 217–243 (1985)

    Google Scholar 

  7. Gonczarowski, J., Warmuth, M.K.: Manipulating Derivation Forests by Scheduling Techniques. Theor. Comput. Sci. 45, 87–119 (1986)

    Google Scholar 

  8. Harrison, M.A.: Introduction to Formal Language Theory. Reading, MA: Addison-Wesley 1978

    Google Scholar 

  9. Kosaraju, S.R.: Decidability of Reachability in Vector Addition Systems. Proc. 14th ACM Symp. on Theory of Computing (1982), pp. 267–281

  10. Kuroda, S.-Y.: Classes of Languages and Linear Bounded Automata. Inf. Control 6, 131–136 (1963)

    Google Scholar 

  11. Kleijn, H.C.M., Rozenberg, G.: Context-Free Like Restrictions on Selective Rewriting. Theor. Comput. Sci. 16, 237–269 (1981)

    Google Scholar 

  12. Mayr, E.W.: An Algorithm for the General Petri Net Reachability Problem. SIAM J. Comput. 13, 441–460 (1984)

    Google Scholar 

  13. Salomaa, A.: Formal Languages. New York: Academic Press 1973

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Hebrew University, 91904, Jerusalem, Israel

    Jakob Gonczarowski

  2. Department of Computer and Information Sciences, University of California at Santa Cruz, Applied Sciences Building, 95064, Santa Cruz, CA, USA

    Manfred K. Warmuth

Authors
  1. Jakob Gonczarowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manfred K. Warmuth
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Part of this research was done while this author visited the Hebrew University and was supported by the Leibniz Center

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gonczarowski, J., Warmuth, M.K. Scattered versus context-sensitive rewriting. Acta Informatica 27, 81–95 (1989). https://doi.org/10.1007/BF00263503

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00263503

Keywords

Search

Navigation