Skip to main content
SpringerLink
Log in

The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages

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

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2295))

Included in the following conference series:

Abstract

The growing context-sensitive languages have been defined by Dahlhaus and Warmuth using strictly monotone grammars, and they have been characterized by Buntrock and Lory’s by weight-increasing grammars. The acyclic context-sensitive languages are defined by context-sensitive grammars the contextfree kernels of which contain no cycles of chain rules, which is equivalent to being context-sensitive and weight-increasing at the same time. p] In this paper we show that these two language classes coincide, that is, for each weight-increasing grammar there exists an equivalent one that is weight-increasing and context-sensitive at the same time.

current address: sd&m AG, software design & management, D-81737 München, Germany, jens.woinowski@sdm.de

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. Erik Aarts. Recognition for acyclic context-sensitive grammars is probably polynomial for fixed grammars. In Proceedings of the 14th International Conference on Computational Linguistics, 1992.

    Google Scholar 

  2. Martin Beaudry, Markus Holzer, Gundula Niemann, and Friedrich Otto. McNaughton Languages. Mathematische Schriften Kassel 26/00, Universität Kassel, November 2000.

    Google Scholar 

  3. Ronald V. Book. Grammars with Time Functions. Phd thesis, Harvard University, Cambridge, Massachusetts, February 1969.

    Google Scholar 

  4. Franz-Josef Brandenburg. Zur Verallgemeinerung von Grammatiken durch Kontext. Seminarberichte des Instituts für Theorie der Automaten und Schaltnetzwerke 73, Gesellschaft für Mathematik und Datenverarbeitung mbH, Bonn, 1974.

    Google Scholar 

  5. Gerhard Buntrock. Wachsende kontextsensitive Sprachen. Habilitationsschrift, Fakultät für Mathematik und Informatik, UniversitätWürzburg, July 1996. English title: Growing contextsensitive languages.

    Google Scholar 

  6. Gerhard Buntrock and Krzysztof Loryś. Ongrowing context-sensitive languages. InW. Kuich, editor, Proceedings of the 19th International Colloquium on Automata, Languages and Programming, number 623 in Lecture Notes in Computer Science, pages 77–88, Berlin/New York, 1992. Springer.

    Google Scholar 

  7. Gerhard Buntrock and Krzysztof Loryś. The variable membership problem: Succinctness versus complexity. In P. Enjalbert, E.W. Mayr, and K.W. Wagner, editors, Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science, number 775 in Lecture Notes in Computer Science, pages 595–606, Berlin/NewYork, 1994. Springer.

    Google Scholar 

  8. Gerhard Buntrock and Friedrich Otto. Growing context-sensitive languages and Church-Rosser languages. Information and Computation, 141:1–36, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  9. Noam Chomsky. On certain formal properties of grammars. Information and Control, 2(2):137–167, June 1959.

    Article  MathSciNet  MATH  Google Scholar 

  10. Elias Dahlhaus and Manfred K. Warmuth. Membership for growing context-sensitive grammars is polynomial. Journal of Computer and System Sciences, 33:456–472, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  11. Aleksey Vsevolodovich Gladkij. On the complexity of derivations in context-sensitive grammars. Algebra i Logika, Seminar, 3(5–6):29–44, 1964. In Russian.

    Google Scholar 

  12. John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Series in Computer Science. Addison-Wesley, Reading, MA, 1979.

    Google Scholar 

  13. Robert McNaughton. An insertion into the chomsky hierarchy? In Juhani Karhumäki, Hermann A. Maurer, Gheorghe Păun, and Grzegorz Rozenberg, editors, Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pages 204–212. Springer, 1999.

    Google Scholar 

  14. Robert McNaughton, Paliath Narendran, and Friedrich Otto. Church-Rosser Thue systems and formal languages. Journal of the Association Computing Machinery, 35:324–344, 1988.

    MATH  MathSciNet  Google Scholar 

  15. Rohit J. Parikh. On context-free languages. Journal of the Association Computing Machinery, 13:570–581, 1966.

    MATH  MathSciNet  Google Scholar 

  16. Jens R. Woinowski. A normal form for Church-Rosser language systems (with appendix). Technical Report TI-7/00, Technische Universität Darmstadt, June 2000.

    Google Scholar 

  17. Jens R. Woinowski. A normal form for Church-Rosser language systems. In A. Middeldorp, editor, Proceedings of the 12th International Conference on Rewriting Techniques and Applications, number 2051 in Lecture Notes in Computer Science, pages 322–337, Berlin, 2001. Springer.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik/Informatik, Universität Kassel, D-34109, Kassel, Germany

    Gundula Niemann

  2. Fachbereich Informatik, TU Darmstadt, D-64289, Darmstadt, Germany

    Jens R. Woinowski

Authors
  1. Gundula Niemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens R. Woinowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Niemann, G., Woinowski, J.R. (2002). The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

  • Online ISBN: 978-3-540-46011-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation