Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)
Acceptors for iteration languages
KeywordsControl Structure Natural Extension Direct Transition Transition Relation Finite Automaton
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.
- 1.Herman, G.T. and Rozenberg, G., Developmental systems and languages, North-Holland Publishing Company, Amsterdam, 1975.Google Scholar
- 2.Leeuwen, J. van, Notes on pre-set pushdown automata, Lecture Notes in Computer Science, No.15:177–188. Springer Verlag, Heidelberg, 1974.Google Scholar
- 3.Rozenberg, G., On a family of acceptors for some classes of developmental languages, International Journal of Computer Mathematics, 4:199–228, 1974.Google Scholar
- 4.Rozenberg, G. and Salomaa, A., The mathematical theory of L systems, in J.T. Tou (ed.), Advances in Information Systems Science, 6, 161–206, 1976.Google Scholar
- 5.Rozenberg, G. and Wood, D., A note on a family of acceptors for some families of developmental languages, Department of Applied Mathematics, Mc Master University, Hamilton, Technical Report, No. 75-CS-7, 1975.Google Scholar
- 6.Salomaa, A., Parallelism in rewriting systems, Lecture Notes in Computer Science, Springer Verlag, Heidelberg, No. 14, 523–533, 1974.Google Scholar
- 7.Salomaa, A., Iteration grammars and Lindenmayer AFL's, Lecture Notes in Computer Science, Springer Verlag, Heidellberg, No. 15,250–253, 1974.Google Scholar
© Springer-Verlag Berlin Heidelberg 1977