Literaturverzeichnis [1] Francine Berman. Edge grammars and parallel computation. In Proceedings of the Al- lerton Conference on Communication, Control, and Computing, pages 214–223, 1983. [2] Francine Berman and Gregory Shannon. Edge grammars: Formal languages and deci- dability issues. In Proceedings of the Allerton Conference on Communication, Control, and Computing, pages 921–930, 1983. [3] Francine Berman and Gregory Shannon. Representing graph families with edge gram- mars. Information Sciences, 70:241–269, 1993. [4] Francine Berman and Lawrence Snyder. On mapping parallel algorithms into parallel architectures. Journal of Parallel and Distributed Computing, 4:439–458, 1987. [5] Jean Berstel and Christophe Reutenauer. Rational Series and Their Languages. Springer-Verlag, Berlin–Heidelberg, 1988. [6] Bruno Courcelle. Graph rewriting: An algebraic and logic approach. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 5, pages 193–242. Elsevier, 1990. [7] J. Dassow, G. Pˇaun, and A. Salomaa. On thinness and slenderness of L languages. Bulletin of the European Association for Theoretical Computer Science, 49:152–158, February 1993. Technical Contributions. [8] Jurgen¨ Dassow. Decision problems for edge grammars. In Mathematical Foundations of Computer Science 1994 (LNCS 841), pages 286–295, 1994. [9] Jurgen¨ Dassow and Gheorghe P˘aun. Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin, 1989. [10] Frank Drewes, Annegret Habel, and Hans-J¨org Kreowski. Hyperedge replacement graph grammars. In Grzegorz Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, volume 1, pages 95–162. World Scientific, Sin- gapore, 1997. [11] Heinz-Dieter Ebbinghaus, J¨org Flum und Wolfgang Thomas. Einf¨uhrung in die ma- thematische Logik. Spektrum Akademischer Verlag, Heidelberg–Berlin–Oxford, 1996. 95 Literaturverzeichnis 96 [12] Grzegorz Rozenberg (editor). Handbook of Graph Grammars and Computing by Graph Transformation, volume 1. World Scientific, Singapore, 1997. [13] Joost Engelfriet. Context-free graph grammars. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages, volume 3, pages 125–213. Springer- Verlag, Berlin–Heidelberg–New York, 1997. [14] Joost Engelfriet and Grzegorz Rozenberg. Node replacement graph grammars. In Grzegorz Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, volume 1, pages 1–94. World Scientific, Singapore, 1997. [15] Henning Fernau and Ralf Stiebe. Regulation by valences. In Igor Pr´ıvara and Peter Ruˇziˇcka, editors, Mathematical Foundations of Computer Science 1997, pages 239– 248, 1997. [16] Sheila A. Greibach. Remarks on blind and partially blind one-way multicounter ma- chines. Theoretical Computer Science, 7:311–324, 1978. [17] Annegret Habel. Hyperedge Replacement Grammars and Languages. Number 643 in LNCS. Springer-Verlag, Berlin–Heidelberg–New York, 1992. [18] John Hopcroft and Jeffrey Ullman. Einf¨uhrung in die Automatentheorie, formale Sprachen und Komplexit¨atstheorie. Addison Wesley, Bonn–Reading(Mass.), 1979. [19] O. H. Ibarra, S. K. Sahni, and C. E. Kim. Finite automata with multiplication. Theoretical Computer Science, 2:271–296, 1976. [20] Oscar H. Ibarra. Restricted one-counter machines with undecidable universe problems. Mathematical Systems Theory, 13:181–186, 1979. [21] Lucian Ilie. On a conjecture about slender context-free languages. Theoretical Com- puter Science, 132:427–434, 1994. [22] Lucian Ilie. On lengths of words in context-free languages. Technical Report 137, TUCS - Turku Centre for Computer Science, 1997. [23] Dirk Janssens and Grzegorz Rozenberg. On the stucture of node label controlled graph languages. Information Sciences, 20:191–216, 1980. [24] Dirk Janssens, Grzegorz Rozenberg, and R. Verraedt. On sequential and parallel node- rewriting graph grammars I. Computer Graphics and Image Processing, 18:279–304, 1982. [25] Dirk Janssens, Grzegorz Rozenberg, and R. Verraedt. On sequential and parallel node- rewriting graph grammars II. Computer Vision, Graphics, and Image Processing, 23:295–312, 1983. Literaturverzeichnis 97 [26] Victor Mitrana. Valence grammars on a free generated group. EATCS Bulletin, 47:174–179, 1992. [27] Victor Mitrana and Ralf Stiebe. The accepting power of finite automata over groups. In G. P˘aun and A. Salomaa, editors, New Trends in Formal Languages, pages 39–48, 1997. [28] Gheorghe P˘aun. A new generative device: Valence grammars. Rev. Roum. Math. Pures Applic., 1980. [29] D. Raz. Length considerations in context-free languages. Theoretical Computer Science, 183(1):21–32, August 1997. [30] V. Red’ko and L. Lisovik. Regular events in semigroups (in Russian). Problems of Cybernetics, 37:155–184, 1980. [31] Hans-Joachim R¨oder. Parallele BNLC-Graphgrammatiken. Dissertation, Universit¨at Passau, 1992. [32] Joseph J. Rotman. An Introduction to the Theory of Groups. Springer-Verlag, New York, 1995. [33] Grzegorz Rozenberg and Arto Salomaa, editors. Handbook of Formal Languages. Springer, Berlin, 1997. [34] Arto Salomaa. Formale Sprachen. Springer, Berlin, 1973. [35] Arto Salomaa and M. Soittola. Automata-Theoretic Aspects of Formal Power Series. Springer-Verlag, New York – Heidelberg – Berlin, 1978. [36] Giorgio Satta. The membership problem for unordered vector grammars. In J. Dassow, G. Rozenberg, and A. Salomaa, editors, Developments in Language Theory II, pages 267–275, 1996. [37] Ralf Stiebe. Slender matrix languages. In Wolfgang Thomas, editor, Developments in Language Theory (Preproceedings), Aachener Informatik-Berichte 99-5, 1999. [38] Sorina Vicolov. Hierarchies of valence languages. In J. Dassow and A. Kelemenova, editors, Developments in Theoretical Computer Science, pages 191–196, Basel, 1994. Gordon and Breach. [39] Sorina Vicolov-Dumitrescu. Grammars, grammar systems, and gsm mappings with valences. In Gheorghe P˘aun, editor, Mathematical Aspects of Natural and Formal Languages, pages 473–491, Singapore, 1994. World Scientific. [40] Lutz Volkmann. Fundamente der Graphentheorie. Springer-Verlag, Wien–New York, 1996..