On the generative capacity of some classes of grammars with regulated rewriting

  • Gheorghe Păun
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)


Generative Capacity Finite Index Simple Matrix Context Grammar Infinite Index 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    BOOK, R., On languages with a certain prefix property, Math. Syst. Theory, 10, 3(1976/77), 229–237.CrossRefGoogle Scholar
  2. 2.
    BRAINERD, B., An analog of a theorem about context-free languages, Inform. Control, 11 (1968), 561–568.CrossRefGoogle Scholar
  3. 3.
    GREIBACH, S., HOPCROFT, J., Scattered context grammars, J. of Computer and System Sci., 3 (1969), 233–247.Google Scholar
  4. 4.
    IBARRA, O., Simple matrix grammars, Inform. Control, 17 (1970), 359–394.CrossRefGoogle Scholar
  5. 5.
    PĂUN, GH., On the generative capacity of simple matrix grammars of finite index, Inform. Proc. Letters, 7, 2(1978), 100–102.CrossRefGoogle Scholar
  6. 6.
    PăUN, GH., On the family of finite index matrix languages, J. of Computer and System Sci., (In press).Google Scholar
  7. 7.
    PăUN, GH., Matrix grammars. Applications, Ed. ŞtiinţificĂ şi EnciclopedicĂ, Bucureşti, 1979 (In Roum.).Google Scholar
  8. 8.
    SALOMAA, A., On the index of context-free languages, Inform. Control, 14 (1969), 474–478.CrossRefGoogle Scholar
  9. 9.
    SALOMAA, A., Formal languages, Academic Press, New York and London, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Gheorghe Păun
    • 1
  1. 1.Division of Systems StudiesUniversity of BucharestBucharestRomania

Personalised recommendations