A general framework for comparing sequential and parallel rewriting

  • H. C. M. Kleijn
  • G. Rozenberg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


Derivation Step Terminal Symbol Formal Language Theory Symmetric Restriction Selector Component 
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.
    Ehrenfeucht, A., Maurer, H.A. and Rozenberg, G., Continuous grammars. Information and Control, 46/1980/,71–91.Google Scholar
  2. 2.
    Kleijn, H.C.M. and Rozenberg, G., Context-free like restrictions on selective rewriting. Inst. Appl. Math. and C.S., University of Leiden, Techn.Rep.No. 80–19.Google Scholar
  3. 3.
    Lomkovskaja, M.V., O nekotoryh svojstvah k-uslovnyh grammatik. Naučno-Techn. Inform.Ser. 2, No. 1/1972/, 16–21.Google Scholar
  4. 4.
    Penttonen, M., ETOL-grammars and N-grammars. Inf. Processing Letters, 4/1975/,11–13.Google Scholar
  5. 5.
    Rozenberg, G., Selective substitution grammars (towards a framework for rewriting systems). Part I: definitions and examples. EIK, 13/1977/, 455–463.Google Scholar
  6. 6.
    Rozenberg, G. and Salomaa, A., The Mathematical Theory of L Systems. Academic Press, New York, 1980.Google Scholar
  7. 7.
    Rozenberg, G. and Wood, D., Context-free grammars with selective rewriting. Acta Informatica, 13/1980/, 257–268.Google Scholar
  8. 8.
    Salomaa, A., Formal Languages. Academic Press, New York, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • H. C. M. Kleijn
    • 1
  • G. Rozenberg
    • 1
  1. 1.Institute of Applied Mathematics and Computer ScienceUniversity of LeidenLeidenThe Netherlands

Personalised recommendations