Skip to main content

End-Marked Maximal Depth-First Contextual Grammars

  • Conference paper
Developments in Language Theory (DLT 2006)

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

Included in the following conference series:

Abstract

In this paper, we present a few results which are of interest for the potential application of contextual grammars to natural languages. We introduce two new classes of internal contextual grammars, called end-marked maximal depth-first and inner end-marked maximal depth-first contextual grammars. We analyze the new variants with respect to the basic properties of the mildly context sensitive languages. With this aim, we show that (i) the three basic non-context-free constructions in natural languages can be realized upon using these variants, (ii) the membership problem for these family of languages is decidable in polynomial time algorithm, (iii) the family of languages generated by end-marked maximal depth-first grammars contains non-semilinear languages. We also solve the following open problem addressed in [3] and [1]: whether the families of languages generated by maximal depth-first and maximal local contextual grammars are semilinear or not?

A part of the work was carried out during the author’s visit to University of Turku, Finland.

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

Access this chapter

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. Ilie, L.: On Computational complexity of contextual languages. Theoretical Computer Science 183(1), 33–44 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Krishna, S., Lakshmanan, K., Rama, R.: On some classes of contextual grammars. International Journal of Computer Mathematics 80(2), 151–164 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Lakshmanan, K., Krishna, S., Rama, R., Martin-Vide, C.: Internal contextual grammars for mildly context sensitive languages. Research on Language and Computation (to appear, 2006)

    Google Scholar 

  4. Marcus, S.: Contextual Grammars. Rev. Roum. Pures. Appl. 14, 1525–1534 (1969)

    MATH  Google Scholar 

  5. Marcus, S., Martin-Vide, C., Păun, G.: On Internal contextual grammars with maximal use of selectors. In: Proc. 8th Conf. Automata & Formal Lang., Salgotarjan (1996), Publ. Math. Debrecen 54, 933–947 (1999)

    Google Scholar 

  6. Martin-Vide, C., Miquel-Verges, J., Păun, G.: Contextual Grammars with depth-first derivation. In: Tenth Twente Workshop on Language Tech., Algebraic Methods in Language Processing, Twente, pp. 225–233 (1995)

    Google Scholar 

  7. Păun, G.: Marcus Contextual Grammars. Kluwer Academic Publishers, Dordrecht (1997)

    MATH  Google Scholar 

  8. Păun, G., Nguyen, X.M.: On the Inner Contextual Grammars. Rev. Roum. Pures. Appl. 25, 641–651 (1980)

    MATH  Google Scholar 

  9. Salomaa, A.: Formal Languages. Academic Press, London (1973)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lakshmanan, K. (2006). End-Marked Maximal Depth-First Contextual Grammars. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_31

Download citation

  • DOI: https://doi.org/10.1007/11779148_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35428-4

  • Online ISBN: 978-3-540-35430-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics