k-Local Internal Contextual Grammars

  • Radu Gramatovici
  • Florin Manea
Conference paper

DOI: 10.1007/978-3-642-22600-7_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)
Cite this paper as:
Gramatovici R., Manea F. (2011) k-Local Internal Contextual Grammars. In: Holzer M., Kutrib M., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg

Abstract

In this paper we propose a generalization of the local internal contextual grammars, introduced by Ilie in 1997, namely the k-local internal contextual grammars. These grammars are, in fact, classical internal contextual grammars, but their only permitted derivations are those that can be described in a restricted manner (that depends on the number k). Using this formalism we define different classes of languages, and obtain a series of language theoretic results for them. Also, we show that the membership problem for k-local internal contextual grammars with polynomial choice can be solved in polynomial time. This seems interesting to us, as it shows that the descriptional restrictions on the derivations of a grammar reflect on the computational efficiency of accepting the language generated by that grammar.

Keywords

Internal contextual grammars k-Local Derivation Hierarchy of languages Membership problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Radu Gramatovici
    • 1
  • Florin Manea
    • 1
    • 2
  1. 1.Faculty of Mathematics and Computer ScienceUniversity of BucharestBucharestRomania
  2. 2.Fakultät für Informatik PSF 4120Otto-von-Guericke-Universität MagdeburgMagdeburgGermany

Personalised recommendations