Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Parallel Grammars: A Phenomenology

  • Published:
Grammars

Abstract

The aim of this paper is at least 2 fold: to give prospective PhD students in the area hints at where to start a promising research; and to supplement earlier reference lists on parallel grammars, trying to cover recent papers as well as ``older'' papers which were somehow neglected in other reviews. Together with the nowadays classical book on L systems by G. Rozenberg and A. Salomaa and with the articles on L systems in the Handbook of Formal Languages, researchers will be equipped with a hopefully comprehensive list of references and ideas around parallel grammars.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Abelson, H. and A.A. diSessa. Turtle Geometry. M.I.T. Press, Cambridge, MA, 1980.

    Google Scholar 

  • Aho, I., H. Kemppainen, K. Koskimies, E. Mäkinen and T. Niemi. Searching neural network structures with L systems and genetic algorithms. International Journal of Computer Mathematics 73(1): 55-75, 1999.

    Google Scholar 

  • Aho, A.V., J.D. Ullman, A.D. Wyner and M. Yannakakis. Bounds on the size and transmission rate of communication protocols. Computers and Mathematics with Applications 8(3): 205-214, 1982.

    Google Scholar 

  • Aho, A.V., J.D. Ullman and M. Yannakakis. Modeling communication protocols by automata. In Proceedings of the 20th Symposium on Foundations of Computer Science, 267-273, October 1979.

  • Aladyev, V. ?n-grammars and their generated languages (in Russian). Transactions of the Academy of Sciences of Estonia; Eest NSV Teaduste Akadeemia toimetised/Biologiline Seeria 23(1): 67-87, 1974a.

    Google Scholar 

  • Aladyev, V. On the equivalence of ?m-grammars and Sb(n)-grammars (in Russian). Commentationes Mathematicae Universitatis Carolinae 15: 717-726, 1974b.

    Google Scholar 

  • Aladyev, V. Operations on languages generated by ?n-grammars (in Russian). Commentationes Mathematicae Universitatis Carolinae 15: 211-220, 1974c.

    Google Scholar 

  • Angluin, D. Finding patterns common to a set of strings. Journal of Computer and System Sciences 21: 46-62, 1980.

    Google Scholar 

  • Angluin, D. Inductive inference of formal languages from positive data. Information and Control (nowInformation and Computation) 45: 117-135, 1980.

    Google Scholar 

  • Angluin, D. Learning regular sets from queries and counterexamples. Information and Computation (formerly Information and Control) 75: 87-106, 1987.

    Google Scholar 

  • Ascoli, G. and J.L. Krichmar. L-neuron: a modeling tool for the efficient generation and parsimonious description of dendritic morphology. Neurocomputing 32-33: 1003-1011, 2000.

    Google Scholar 

  • B?l?nescu, T., M. Gheorghe and Gh. Păun. Three variants of apical growth; filamentous systems. International Journal of Computer Mathematics 22: 227-238, 1987.

    Google Scholar 

  • Barnsley, M.F. Fractals Everywhere. Academic Press, Boston, MA, 1988.

    Google Scholar 

  • Blum M. and C. Hewitt. Automata on a two-dimensional tape. In IEEE Symposium on Switching and Automata Theory, pp. 155-160, 1967.

  • Blum, M. and W.J. Sakoda. On the capability of finite automata in 2 and 3 dimensional space. In Proceedings of the 18th Annual Symposium on Foundations in Computer Science, pp. 147-161, 1977.

  • Bordihn, H. Pure languages and the degree of nondeterminism. Journal of Information Processing and Cybernetics EIK (formerly Elektron. Inf.verarb. Kybern.) 28(5): 231-240, 1992.

    Google Scholar 

  • Bordihn, H. and J. Dassow. A note on the degree of nondeterminism. Technical Report Preprint FIN-IRB-7/93, Technische Universitt “Otto von Guericke” Magdeburg, July 1993.

  • Bordihn, H., H. Fernau and M. Holzer. On accepting pure Lindenmayer systems. Fundamenta Informaticae 38(4): 365-375, 1999.

    Google Scholar 

  • Bordihn H. and M. Holzer. On the number of active symbols in L and CD grammar systems. Journal of Automata, Languages and Combinatorics 6(4): 411-426, 2001.

    Google Scholar 

  • Brandenburg, F.J. On the height of syntactical graphs. In Deussen, P., editor, Proceedings of the 5th GI-Conference on Theoretical Computer Science, volume 104 of LNCS, pp. 13-21, Karlsruhe, FRG, March 1981. Springer, Berlin.

    Google Scholar 

  • Bucher, W. and K. Čulik II. On real time and linear time cellular automata. RAIRO Informatique Théorique 18: 307-325, 1984.

    Google Scholar 

  • Buchholz, Th., A. Klein and M. Kutrib. One guess one-way cellular arrays. In Brim, L., J. Gruska and J. Zlatuška, editors, Mathematical Foundations of Computer Science MFCS 1998, volume 1450 of LNCS, pp. 807-815. Springer, Berlin, 1998.

    Google Scholar 

  • Burks, A. The Theory of Self-Reproducing Automata, chapter J. von Neumann. The University of Illinois Press, Urbana-Champaign, IL, 1966.

    Google Scholar 

  • Calude, C.S., Gh. Păun and M. Tataram. A glimpse into natural computing. Report CDMTCS-117, Centre for Discrete Mathematics and Theoretical Computer Science,University of Auckland, Auckland, New Zealand, December 1999.

    Google Scholar 

  • Carlyle, J.W., S.A. Greibach and A. Paz. A two-dimensional generating system modeling growth by binary cell division (preliminary report). In XV Annual Conference on Switching and Automata Theory, pp. 1-12, 1974.

  • Cassaigne, J. and J. Karhumäki. Toeplitz words, generalized periodicity and periodically iterated morphisms. European Journal of Combinatorics 18: 497-510, 1997.

    Google Scholar 

  • Choffrut Ch. and K. Čulik II. On real-tome cellular automata and trellis automata. Acta Informatica 21: 393–407, 1984.

    Google Scholar 

  • Cook C.R. and P.S.-P. Wang A Chomsky hierarchy of isotonic array grammars and languages. Computer Graphics and Image Processing 8: 144–152, 1978.

    Google Scholar 

  • Carradini, A. and F. Drewes.(Cyclic) term graph rewriting is adequate for rational parallel term rewriting.Technical Report TR-97-14,Depatimento di Informatica, July 16 1997.

  • Csuhaj-VarjÚ, E., J. Dossow, J. Kelemen, and Gh. Păun. Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, London, 1994.

    Google Scholar 

  • Csuhaj-VarjÚ, E. and A. Salomaa. Networks of language processors: Parallel communicating systems. Bulletin of the EATCS 66: 122-138, 1998.

    Google Scholar 

  • Csuhaj-VarjÚ, E. and Gy. Vaszil. Parallel communicating grammar systems with incomplete information communication. In Kuich, W., G. Rozenberg, and A. Salomaa, editors, Developments in Language Theory. Preproceedings of the 5th Interantional Conference, DLT 2001, Wien, Austria, July 16-21, volume 2295 of LNCS, pp. 381-392. Springer, Berlin, 2002.

    Google Scholar 

  • Čulik, K., II and S. Dube. L-systems and mutually recursive function systems. Acta Informatica 30: 279-302, 1993.

    Google Scholar 

  • Čulik, K., II and A. Lindenmayer. Parallel graph generating and graph recurrence systems for multicellular development. International Journal of General Systems 3: 53-66, 1976.

    Google Scholar 

  • Damm, C., M. Holzer, K.-J. Lange, and P. Rossmanith. Deterministic 0L languages are of very low complexity: D0L is in AC0. In Rozenberg, G. and A. Salomaa, editors, Developments in Language Theory (Turku, 1993), 305-313. World Scientific, Singapore, 1994.

    Google Scholar 

  • Dassow, J. A remark on limited 0L systems. Journal of Information Processing and Cybernetics EIK (formerly Elektron. Inf.verarb. Kybern.) 24(6): 287-291, 1988.

    Google Scholar 

  • Dassow, J. and U. Fest. On regulated L systems. Rostock, Mathematisches Kolloquium 25: 99-118, 1984.

    Google Scholar 

  • Dassow, J., Gh. Păun and A. Salomaa. Grammars based on patterns. International Journal of Foundations of Computer Science 4: 1-14, 1993.

    Google Scholar 

  • Dassow, J. and D. Wätjen. On the relations between the degree of synchronization and the degree of nondeterminism in k-limited and uniformly k-limited T0L systems. International Journal of Computer Mathematics 35: 69-82, 1990.

    Google Scholar 

  • Dekking, F.M. Recurrent sets. Advances in Mathematics 44: 78-104, 1982.

    Google Scholar 

  • Deransart, P. and M. Jourdan, editors. Attribute Grammars and their Applications, volume 461 of Lecture Notes in Computer Science. Springer, Berlin, 1990.

    Google Scholar 

  • Deussen, O., P. Hanrahan, B. Lintermann, R. Mech, M. Pharr and P. Prusinkiewicz. Realistic modeling and rendering of plant ecosystems. In SIGGRAPH '98, Proceedings of the 25th Annual Conference on Computer Graphics, pp. 275-286. ACM, 1998.

  • DeVaul, R. and B. McCormick. Neuron developmental modeling and structural representation: The statistical model; an introduction to the n++ language, an open stochastic L-system. Technical Report, Scientific Visualization Laboratory, Department of Computer Science, Texas A&M University, College Station, TX 778433112, July 1997.

    Google Scholar 

  • Diekert, V. and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.

    Google Scholar 

  • de Does, M. and A. Lindenmayer. Algorithms for the Generation and Drawing of Maps Representing Cell Clones, volume 153 of LNCS, pp. 39-57. Springer, Berlin, 1983.

    Google Scholar 

  • Dong, G. Grammar tools and characterizations. In Proceedings of the Eleventh ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems (PODS'92), 81-90. ACM, June 1992.

  • Downey, R.G. and M.R. Fellows. Parameterized Complexity. Springer, Berlin, 1999.

    Google Scholar 

  • Drewes, F. Language-theoretic and algorithmic properties of d-dimensional collages and patterns in a grid. Journal of Computer and System Sciences 53: 33-60, 1996.

    Google Scholar 

  • Drewes F., A. Habel, H.-J. Kreowski and S. Taubenberger. Generating self-affine fractals by collage grammars. Theoretical Computer Science 145: 159-187, 1995.

    Google Scholar 

  • Dyer, C.R. One-way bounded cellular automata. Information and Computation 44: 261-281, 1980.

    Google Scholar 

  • Echahed, R. and J.-C. Janodet. Parallel admissible graph rewriting. In Fiadeiro, J.L. editor, WADT'98, volume 1589 of LNCS, 122-138. Springer, Berlin, 1999.

    Google Scholar 

  • Ehlers, E.M. and S.H. von Solms. Using random context structure grammars to represent chemical structures. Information Processing Letters 30(3): 159-166, February 1989.

    Google Scholar 

  • Ermel, D. k-limitierte IL-systeme. Studienarbeit, Technische Universität Braunschweig, 2001. See Studienarbeiten/Ermel.pdf at Site 20.

    Google Scholar 

  • Ermel, D. and D. Wätjen. Limited IL systems. Journal of Automata, Languages and Combinatorics, 2002. To appear.

  • Fernau, H. Ersetzungssysteme mit eingeschränkter Parallelität. In Workshop über Parallelverarbeitung (Informatik-Bericht 91/1), 41-58. TU Clausthal: Informatik Colloquium Lessach (Österreich) 1990, 1991a.

    Google Scholar 

  • Fernau, H. On function-limited Lindenmayer systems. Journal of Information Processing Cybernetics EIK (formerly Elektron. Inf. verarb. Kybern.) 27(1): 21-53, 1991b.

    Google Scholar 

  • Fernau, H. Membership for 1-limited ET0L languages is not decidable. Journal of Information Processing Cybernetics EIK (formerly Elektron. Inf.verarb. Kybern.) 30(4): 191-211, 1994.

    Google Scholar 

  • Fernau, H. A note on uniformly limited ET0L systems with unique interpretation. Information Processing Letters 54: 199-204, 1995.

    Google Scholar 

  • Fernau, H. A predicate for separating language classes. Bulletin of the EACTS 56: 96-97, 1995.

    Google Scholar 

  • Fernau, H. Closure properties of ordered languages. Bulletin of the EACTS 58: 159-162, 1996.

    Google Scholar 

  • Fernau, H. Membership for k-limited ET0L languages is not decidable. Journal of Automata, Languages and Combinatorics 1: 243-245, 1996.

    Google Scholar 

  • Fernau, H. On grammar and language families. Fundamenta Informaticae 25(1): 17-34, 1996.

    Google Scholar 

  • Fernau, H. Efficient learning of some linear matrix languages. In Asano, T., Y. Mai, D.T. Lee, S.-I. Nakano and T. Tokuyama, editors, COCOON'99, volume 1627 of LNCS, pp. 221-230. Springer, Berlin, 1999.

    Google Scholar 

  • Fernau, H. Even linear simple matrix languages: formal language aspects. In Calude, C.S., M.J. Dinneen, and S. Sburlan, editors, Discrete Mathematics and Theoretical Computer Science, DMTCS'01, pp. 81-96, 2001a.

  • Fernau, H. Nonterminal complexity of programmed grammars. In Margenstern, M. and Y. Rogozhin, editors, Machines, Computations, and Universality; 3rd MCU, volume 2055 of LNCS, pp. 202-213, Springer, Berlin, 2001. Theoretical Computer Science, 2003.

    Google Scholar 

  • Fernau, H. Parallel communicating grammar systems with terminal transmission. Science, 2003 Acta Informatica 37: 511-540, 2001b.

    Google Scholar 

  • Fernau, H. and H. Bordihn. Remarks on accepting parallel systems. International Journal of Computer Mathematics 56: 51-67, 1995.

    Google Scholar 

  • Fernau, H. and R. Freund. Bounded parallelism in array grammars used for character recognition. In Perner, P., P. Wang and A. Rosenfeld, editors, Advances in Structural and Syntactical Pattern Recognition (Proceedings of the SSPR'96), volume 1121 of LNCS, pp. 40-49. Springer, Berlin, 1996.

    Google Scholar 

  • Fernau, H. and R. Freund. Accepting array grammars with control mechanisms, In Păun, Gh. and A. Salomaa, editors, New Trends in Formal Languages, volume 1218 of LNCS, pp. 95-118. Springer, Berlin, 1997.

    Google Scholar 

  • Fernau, H., R. Freund, and M. Holzer. Character recognition with k-head finite array automata, In Amin A. D. Dori, P. Pudil and H. Freeman, editors, Proceedings of SSPR'98, volume 1451 of LNCS, pp. 282-291, Springer, Berlin, 1998.

    Google Scholar 

  • Fernau, H. and M. Holzer. Regulated finite index language families collapse, Technical Report WSI-96-16, Universität Tübingen, Wilhelm-Schickard-Institut für Informatik, 1996.

  • Fernau H., and M. Holzer. Conditional context-free languages of finite index. In Păun, Gh. and A. Salomaa, editors, New Trends in Formal Languages, volume 1218 of LNCS, pp. 10-26. Springer, Berlin, 1997.

    Google Scholar 

  • Fernau, H. and A. Meduna. On the degree of scattered context-sensitivity. Theoretical Computer Science. 290: 2121-2124, 2003a.

    Google Scholar 

  • Fernau, H. and A. Meduna. A simultaneous reduction of several measures of descriptional complexity in scattered context grammars, Information Processing Letter, to appear, 2003b.

  • Fernau, H. and F. Stephan. Characterizations of recursively enumerable languages by programmed grammars with unconditional transfer. Journal of Automata, Languages and Combinatorics 4(2): 117-142, 1999.

    Google Scholar 

  • Fernau, H. and R. Stiebe. Valences in Lindenmayer systems. Fundamenta Informaticae 45: 329-358, 2001.

    Google Scholar 

  • Fernau, H. and D. Wätjen. Remarks on regulated limited ET0L systems and regulated context-free grammars. Theoretical Computer Science 194(1-2): 35-55, 1998.

    Google Scholar 

  • Foster, I. and C. Kesselman, editors. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco, CA,1999.

    Google Scholar 

  • Freund, R. Aspects of n-dimensional Lindenmayer systems. In Rozenberg, G. and A. Salomaa, editors, Developments in Language Theory; At The Crossroads of Mathematics, Computer Science and Biology (Turku, Finland, 12-15 July 1993), pp. 250-261. World Scientific, Singapore, 1994.

    Google Scholar 

  • Freund, R. Control mechanisms on #-context-free array grammars. In Păun, Gh., editor, Mathematical Aspects of Natural and Formal Languages, pp. 97-137. World Scientific, Singapore, 1994.

    Google Scholar 

  • Freund, R., M. Neubauer, M. Summerer, St. Gruber, J. Schaffer, and R. Swoboda. A hybrid system for the recognition of hand-written characters. In Ferri, F.J., J.M. Inesta, A. Amin, and P. Pudil, editors, Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, volume 1876 of LNCS, pp. 67-76. Springer, Berlin, 2000.

    Google Scholar 

  • Freund, R. and Gh. Păun. On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars. In Margenstern, M. and Y. Rogozhin, editors, Machines, Computations, and Universality; 3rd MCU, volume 2055 of LNCS, pp. 214-225. Springer, Berlin, 2001.

    Google Scholar 

  • Freund, R. and F. Tafill. Modelling Kohonen networks by attributed parallel array systems. In Conference on Neural Networks and Artificial Intelligence, International Symposium on Substance Identification Technologies (Innsbruck, 1993), October 1993.

  • Frid, A.E. On the frequency of factors in a D0L word. Journal of Automata, Languages and Combinatorics 3(1): 29-41, 1998.

    Google Scholar 

  • Gärtner, S. A remark on the regulation of klET0L systems. Information Processing Letters 48: 83-85, 1993.

    Google Scholar 

  • Gärtner, S. On partition limited 0L systems. In Dassow, J., G. Rozenberg and A. Salomaa, editors, Developments in Language Theory II; At the Crossroads of Mathematics, Computer Science and Biology, pp. 230-236. World Scientific, Singapore, 1996.

    Google Scholar 

  • Giammarresi, D. and A. Restivo. Two-dimensional finite state recognizability. Fundamenta Informaticae 25: 399-422, 1996.

    Google Scholar 

  • Giammarresi, D., A. Restivo, S. Seibert and W. Thomas, Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Information and Computation (formerly Information and Control) 125: 32-45, 1996.

    Google Scholar 

  • Gilbert, W.J. Fractal geometry derived from complex bases. The Mathematical Intelligencer 4: 78- 86, 1982.

    Google Scholar 

  • Gilbert, W.J. The fractal dimension of sets derived from complex bases. Canadian Mathematical Bulletin 29: 495-500, 1986.

    Google Scholar 

  • Golan, J.S., A. Mateescu and D. Vaida. Semirings and parallel composition of processes. Journal of Automata, Languages and Combinatorics 1: 199-217, 1996.

    Google Scholar 

  • Gold, E.M. Language identification in the limit. Information and Control (now Information and Computation) 10: 447-474, 1967.

    Google Scholar 

  • Gonczarowski, J. and M.K. Warmuth. Scattered versus context-sensitive rewriting. Acta Informatica 27: 81-95, 1989.

    Google Scholar 

  • Greibach, S. and J. Hopcroft. Scattered context grammars. Journal of Computer and System Sciences 3: 233-247, 1969.

    Google Scholar 

  • Gruska, J. A characterization of context-free languages. Journal of Computer and System Sciences 5: 353-364, 1971.

    Google Scholar 

  • Haeseler, F.v., H.-O. Peitgen, and G. Skordev. Linear cellular automata, substitutions, hierarchical iterated function systems and attractors. In Encarnaçao, J.L. et al., editors, Fractal Geometry and Computer Graphics, Beiträge zur Graphischen Datenverarbeitung des ZGDV (Darmstadt), pp. 3-23. Springer, Berlin, 1992.

    Google Scholar 

  • Hartmann, P. Implementation of parallel replacement systems for cellular hypergraphs. Journal of Automata, Languages and Combinatorics 1(2): 129-146, 1996.

    Google Scholar 

  • de la Higuera, C. Characteristic sets for polynomial grammatical inference. Machine Learning 27(2): 125-138, 1997.

    Google Scholar 

  • Ibarra, O. Simple matrix languages. Information and Control (now Information and Computation) 17: 359-394, 1970.

    Google Scholar 

  • Inoue, K. and I. Takanami. A survey of two-dimensional automata theory. In Dassow, J. and J. Kelemen, editors, Machines, Languages, and Complexity, IMYCS'88, volume 381 of LNCS, pp. 72-91. Springer, Berlin, 1988.

    Google Scholar 

  • Ito, M., L. Kari, and G. Thierrin. Insertion and deletion closure of languages. Theoretical Computer Science 183: 3-19, 1997.

    Google Scholar 

  • Jacob, C. Genetic L-system programming. In PPSN III-Parallel Problem Solving from Nature, International Conference on Evolutionary Computation, volume 866 of LNCS, pp. 334-343. Springer, Berlin, 1994a.

    Google Scholar 

  • Jacob, C. Modeling growth with L-systems & Mathematica. Mathematica in Education and Research 4: 12-19, 1994b.

    Google Scholar 

  • Jacob, C. Genetic L-system programming: Breeding and evolving artificial flowers with Mathematica. In IMS'95, Proceedings of the First International Mathematica Symposium, 215-222. Computational Mechanics Publications, Southampton, UK, 1995.

    Google Scholar 

  • Jacob, C. and J. Rehder. Evolution of neural net architectures by a hierarchical grammar-based genetic system. In Albrecht, R. and N. Steele, editors, ICANNGA'93, Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, pp. 72-79, 1993.

  • Jiang, T., A. Salomaa, K. Salomaa and S. Yu. Decision problems for patterns. Journal of Computer and System Sciences 50: 53-63, 1995.

    Google Scholar 

  • Jiménez-López, M.D. Grammar Systems: A Formal Language Theoretic Framework for Linguistics and Cultural Evolution. PhD thesis, Rovira i Virgili University, Tarragona, Spain, 2000.

    Google Scholar 

  • Joshi, A.K. How much context-sensitivity is necessary for characterizing structural descriptions - tree adjoining grammars. In Dowty, D., L. Karttunen, and A. Zwicky, editors, Natural Language Processing - Theoretical, Computational and Psychological Perspectives, pp. 206-250. Cambridge University Press, Cambridge, 1985.

    Google Scholar 

  • Joshi, A.K., L.S. Levy, and M. Takahashi. Tree adjunct grammars. Journal of Computer and System Sciences 10: 133-163, 1975.

    Google Scholar 

  • Jürgensen, H. and A. Lindenmayer. Inference algorithms for developmental systems with cell lineages. Bulletin of Mathematical Biology 49(1): 93-123, 1987.

    Google Scholar 

  • Kari, L., H. Lutfiyya, C. Martín-Vide and Gh. Păun. Bringing PC grammar systems closer to Hoare's CSP. In Păun, Gh. and A. Salomaa, editors, Grammatical Models of Multi-Agent Systems, pp. 64-86. Gordon and Breach, London, 1999.

    Google Scholar 

  • Kelemen, J. and A. Kelemenová. Grammar systems: where are we? And where do we go from here? Journal of Automata, Languages and Combinatorics 5(1): 5-12, 2000. Special issue: Selected papers of the MFCS'98 Satellite Workshop on Grammar Systems, Brno, 1998. Guest editors: J. Kelemen and A. Kelemenová.

  • Kelemen, J., A. Kelemenová and A. Lindenmayer. Answers by A. Lindenmayer to questions of J. Kelemen and A. Kelemenová. Bulletin of the EATCS 23: 185-198, 1984.

    Google Scholar 

  • Kelemen, J., A. Kelemenová, C. Martín Vide and V. Mitrana. Colonies with limited activation of components. Theoretical Computer Science 244: 289-298, 2000.

    Google Scholar 

  • Kelemenová, A. and E. Csuhaj-VarjÚ. Languages of colonies. Theoretical Computer Science 134(1): 119-130, 1994.Selected papers of the Second International Colloquium on Words, Languages and Combinatorics, Kyoto, 1992.

    Google Scholar 

  • Kelemenová, A. and J. Kelemen. From colonies to eco(grammar)systems: an overview. In Karhumäki, J., H.A. Maurer, and G. Rozenberg, editors, Results and Trends in Theoretical Computer Science, volume 812 of LNCS, pp. 213-231. Springer, Berlin, 1994.

    Google Scholar 

  • Kelemenová, A. and P. Vajgel. Productions in stable 0L systems. In Rozenberg, G. and A. Salomaa, editors, Developments in Language Theory (Turku, 1993), pp. 102-110. World Scientific, Singapore, 1994.

    Google Scholar 

  • Klein, A. and M. Kutrib. A time hierarchy for bounded one-way cellular automata. In Sgall, J., A. Pultr and P. Kolman, editors, Mathematical Foundations of Computer Science, MFCS 2001, volume 2136 of LNCS, pp. 439-450. Springer, Berlin, 2001. Long version to appear in Theoretical Computer Science.

    Google Scholar 

  • Klempien-Hinrichs, R., H.-J. Kreowski and S. Taubenberger. Correct translation of mutually recursive function systems into T0L collage grammars. In Ciobanu, G. and Gh. Păun, editors, Fundamentals of Computation Theory, FCT'99, volume 1684 of LNCS, pp. 350-361. Springer, Berlin, 1999.

    Google Scholar 

  • Knuth, D.E. Semantics of context-free languages. Mathematical Systems Theory 2: 127-145, 1968.

    Google Scholar 

  • Knuth, D.E. Correction: Semantics of context-free languages. Mathematical Systems Theory 5(1): 95-96, 1971.

    Google Scholar 

  • von Koch, H. Une méthode géométrique élémentaire pour l'étude de certaines questions de la théorie de courbes planes. Acta Mathematica 30: 145-174, 1905.

    Google Scholar 

  • Kókai, G., Z. Tóth and R. Ványi. Evolving artificial trees described by parametric L-systems. In IEEE Canadian Conference on Electrical & Computer Engineering, 1722-1728, 1999a.

  • Kókai, G., Z. Tóth and R. Ványi. Modelling blood vessels of the eye with parametric L-systems using evolutionary algorithms, In Horn, W., Y. Shahar, G. Lindberg, S. Andreassen and J. Wyatt, editors, Artificial Intelligence in Medicine AIMDM'99, volume 1620 of LNCS/LNAI, pp. 433-442. Springer, Berlin, 1999b.

    Google Scholar 

  • Kókai, G., R. Ványi and Z. Tóth. Parametric L-system description of the retina with combined evolutionary operators. In Banzhaf, W., J. Daida, A.E. Eiben, M.H. Garzon, V. Honavar, M. Jakiela and R.E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference – GECCO-1999, pages -. Morgan Kaufmann, San Francisco, CA, 1999c.

    Google Scholar 

  • Koza, J.R. Discovery of rewrite rules in Lindenmayer systems and state transition rules in cellular automata via genetic programming. In Symposium on Pattern Formation (SPF-93), Claremont, CA, USA, 1993.

    Google Scholar 

  • Kudlek, M. Languages defined by Indian parallel systems. In Rozenberg, G. and A.K. Salomaa, editors, The Book of L, pp. 233-244. Springer, Berlin, 1985.

    Google Scholar 

  • Kudlek, M. Dead word languages and adult languages. Pure Mathematics and Applications, Ser. A 1(3/4): 343-355, 1990.

    Google Scholar 

  • Kudlek, M. Mix operation with catenation and shuffle. In Bozapalidis, S. editor, Proceedings of the 3rd International Conference Developments in Language Theory, pp. 387-398. Aristotle University, Thessaloniki, 1997a.

    Google Scholar 

  • Kudlek, M. On mix operation. In Păun, Gh. and A. Salomaa, editors, New Trends in Formal Languages, volume 1218 of LNCS, pp. 430-439. Springer, Berlin, 1997b.

    Google Scholar 

  • Kudlek, M. and A. Mateescu. On distributed catenation. Theoretical Computer Science 180: 341-352, 1997.

    Google Scholar 

  • Kurth, W. Towards universality of growth grammars: models of Bell, Pagès, and Takenaka revisited. Ann. For. Sci. 57: 543-554, 2000.

    Google Scholar 

  • Kurth, W. and B. Sloboda. Tree and stand architecture described by formal grammars. Journal of Forest Science 45: 16-30 & 53-63, 1999.

    Google Scholar 

  • Lautemann, C., T. Schwentick, and D. Thérien. Logics for context-free languages. In CSL: 8th Workshop on Computer Science Logic, volume 933 of LNCS, pp. 205-216. Springer, Berlin, 1994.

    Google Scholar 

  • Lehman, E. and A. Shelat. Approximations algorithms for grammar-based compression. In Thirteenth Annual Symposium on Discrete Algorithms (SODA'02), 2002.

  • Levitina, M.K. On some grammars with rules of global replacement (in Russian). Scientific-Technical Information (Nauchno-tehnichescaya informacii), Series 2 (3): 32-36, 1972.

    Google Scholar 

  • Lindenmayer, A. Mathematical models for cellular interactions in development I. Filaments with one-sided inputs. Journal of Theoretical Biology 18: 280-299, 1968a.

    Google Scholar 

  • Lindenmayer, A. Mathematical models for cellular interactions in development II. Simple and branching filaments with two-sided inputs. Journal of Theoretical Biology 18: 300-315, 1968b.

    Google Scholar 

  • Lindenmayer, A. Developmental systems without cellular interactions, their languages and grammars. Journal of Theoretical Biology 30: 455-484, 1971.

    Google Scholar 

  • Lindenmayer, A. Adding continuous components to L-systems. In Rozenberg, G. and A. Salomaa, editors, L Systems, volume 15 of LNCS, pp. 53-68. Springer, Berlin, 1974.

    Google Scholar 

  • López, D. and I. Piñaga. Syntactic pattern recognition by error correcting analysis on tree automata. In Ferri, F.J., J.M. I\(\overline {\text{n}} \)esta, A. Amin and P. Pudil, editors, Advances in Pattern Recognition, Joint IAPR International Workshops SSPR+SPR'2000, volume 1876 of LNCS, pp. 133-142. Springer, Berlin, 2000.

    Google Scholar 

  • Mariano, A., P. Moscato, and M.G. Norman. Using L-systems to generate arbitrarily large instances of the Euclidean traveling salesman problem with known optimal tours. In Anales del XXVII Simposio Brasileiro de Pesquisa Operacional, 1995. See Site 10, file final.ps.Z.

  • Martín-Vide, C. Natural language understanding: a new challenge for grammar systems. Acta Cybernetica 12: 461-472, 1996.

    Google Scholar 

  • Mateescu, A. Special families of matrix languages and decidable problems. Acta Cybernetica 10: 45-52, 1991.

    Google Scholar 

  • McCulloch, W.S. Embodiments of the Mind, chapter McCulloch and Pitts: A logical calculus of the ideas immanent in nervous activity, pp. 19-39. MIT Press, Cambridge, MA, 1965, originally the article appeared in 1943.

    Google Scholar 

  • Meduna, A. Generative power of three-nonterminal scattered context grammars. Theoretical Computer Science 246: 279-284, 2000.

    Google Scholar 

  • Meltzer, B. and D. Michie, editors. Machine Intelligence, volume 7, chapter Herman, G.T., A.D. Walker: The syntactic inference problem applied to biological systems, pp. 341-356. Edinburgh University Press, 1972.

  • Mitrana, V., Gh. Păun, G. Rozenberg, and A. Salomaa. Pattern systems. Theoretical Computer Science 154: 183-201, 1996.

    Google Scholar 

  • Morcrette, M. Sur l'équivalence de descriptions de figures itérées. Theoretical Computer Science 165: 325-354, 1996.

    Google Scholar 

  • Morita, K., Y. Yamamoto, and K. Sugata. The complexity of some decision problems about two-dimensional array grammars. Information Sciences 30: 241-262, 1983.

    Google Scholar 

  • Moscato, P. and M.G. Norman. An analysis of the performance of traveling salesman heuristics on infinite-size fractal instances in the Euclidean plane. See Site 10, file lsystem7.ps.Z, October 1994.

  • Narbel, Ph. Limits and Boundaries of Word and Tiling Substitutions. PhD thesis, Université Paris 7, 1993.

  • Narbel, Ph. Geometrical 0L-systems coming from tilings of the plane. In Rozenberg, G. and A. Salomaa, editors, Developments in Language Theory (Turku, 1993), pp. 237-249. World Scientific, Singapore, 1994.

    Google Scholar 

  • Nevill-Manning, C.G. and I.H. Witten. Compression and explanation using hierarchical grammars. The Computer Journal 40(2/3): 103-116, 1997.

    Google Scholar 

  • Nevill-Manning, C.G. and I.H. Witten. Online and offline heuristics for inferring hierarchies of repetitions in sequences. In Proc. IEEE. To appear.

  • Nirmal, N. and K. Krithivasan. Filamentous systems with apical growth. International Journal of Computer Mathematics 12: 203-215, 1983.

    Google Scholar 

  • Nishida, T.Y. Sizes of context-free languages generated by context-free grammars and stable and recurrent 0L systems. Journal of Automata, Languages and Combinatorics 6(4): 507-518, 2001.

    Google Scholar 

  • Nolle, M. Ein Vergleich zwischen L-Systemen, iterierten Funktionensystemen und ähnlichen Methoden zur Erzeugung von Fraktalen. Studienarbeit, Universität Karlsruhe (TH), 1992.

    Google Scholar 

  • Nolle, M. Comparison of Different Methods for Generating Fractals. In J. Dassow and A. Kelemenová, editors, Developments in Theoretical Computer Science pp. 163-173. Gordon and Breach, Basel, 1994.

    Google Scholar 

  • Norman, M.G. and P. Moscato. The Euclidean traveling salesman problem and a space-filling curve. Chaos, Solitons and Fractals 6: 389-397, 1995. See Site 10, file peano.ps.Z.

    Google Scholar 

  • Ochoa, G. On genetic algorithms and Lindenmayer systems. In Eiben, A. Baeck, M. Schoenauer, and H.P. Schwefel, editors, PPSN V-Parallel Problem Solving from Nature, volume 1498 of LNCS, pp. 335-344. Springer, Berlin, 1998.

    Google Scholar 

  • Pascu, A. and Gh. Păun. On simple matrix grammars, Bulletin Mathématique de la Société Sciences Mathématiques de la R. S. de Roumanie 20: 333-340, 1976.

    Google Scholar 

  • Păun, Gh. Linear simple matrix languages. Elektronische Informationsverarbeitung und Kybernetik (now Journal of Information Processing and Cybernetics EIK) 14: 377-384, 1978.

    Google Scholar 

  • Păun, Gh. On simple matrix languages versus scattered context languages, RAIRO Informatique Théorique 16(3): 245-253, 1982.

    Google Scholar 

  • Păun, Gh. Valences: increasing the power of grammars, transducers, grammar systems. Bulletin of the EATCS 48: 143-156, 1992.

    Google Scholar 

  • Păun, Gh. Marcus Contextual Grammars. Kluwer, Dordrecht, 1997.

    Google Scholar 

  • Păun, Gh. and C.S. Calude. Computing with Cells and Atoms. Taylor & Francis, London, 2001.

    Google Scholar 

  • Păun, Gh. and G. Rozenberg. Prescribed teams of grammars. Acta Informatica 31: 525-537, 1994.

    Google Scholar 

  • Păun, Gh., G. Rozenberg and A. Salomaa. Contextual grammars: Parallelism and blocking of derivation. Fundamenta Informaticae 25: 381-397, 1996.

    Google Scholar 

  • Păun, Gh., G. Rozenberg and A. Salomaa. Pattern grammars. Journal of Automata, Languages and Combinatorics 1(3): 219-235, 1996.

    Google Scholar 

  • Păun, Gh., G. Rozenberg and A. Salomaa. DNA Computing: New Computing Paradigms. Springer, Berlin, 1998.

    Google Scholar 

  • Păun Gh. and A. Salomaa, editors. Grammatical Models of Multi-Agent Systems, chapter Fernau, H., R. Freund, and M. Holzer: Regulated array grammars of finite index, pp. 157-181 (Part I) and pp. 284-296 (Part II). Gordon and Breach, London, 1999.

  • Paz, A. Multidimensional Parallel Rewriting Systems, pp. 509-515. North-Holland, Amsterdam, 1976.

    Google Scholar 

  • Pecht, J. On the real-time recognition of formal languages in cellular automata. Acta Cybernetica 6: 33-53, 1983.

    Google Scholar 

  • Peitgen, H.-O., A. Rodenhausen and G. Skordev. Self-affine curves and sequential machines. Real Analysis Exchange 22(2): 446-491, 1996-1997.

    Google Scholar 

  • Prusinkiewicz, P. A look at the visual modeling of plants using L-systems. In Hofestädt, R., Th. Lengauer, M. Löffler and D. Schomburg, editors, Bioinformatics, German Conference on Bioinformatics, Leipzig, Germany, September 30 - October 2, 1996, Selected Papers; volume 1278 of LNCS, pp. 11-29. Springer, Berlin, 1997.

    Google Scholar 

  • Prusinkiewicz, P. Simulation modeling of plants and plant ecosystems. Communications of the ACM 43: 84-93, 2000.

    Google Scholar 

  • Prusinkiewicz, P., M. Hammel, R. M?ch, and J. Hanan. The artificial life of plants. In Artificial Life for Graphics, Animation, and Virtual Reality, volume 7 of SIGGRAPH'95 Course Notes, pp. 1-38. ACM, ACM Press, 1995.

    Google Scholar 

  • Prusinkiewicz, P. and L. Kari. Subapical bracketed L-systems. In Curry, J., H. Ehrig, G. Engels and G. Rozenberg, editors, Grammars and Their Application to Computer Science, volume 1073 of LNCS, pp. 550-564, Springer, Berlin, 1996.

    Google Scholar 

  • Prusinkiewicz, P. and A. Lindenmayer. The Algorithmic Beauty of Plants. Springer, New York, 1990.

    Google Scholar 

  • Prusinkiewicz, P., L. Mündermann, R. Karwowski and B. Lane. The use of positional information in the modeling of plants. In SIGGRAPH 2001, Proceedings of the 28th Annual Conference on Computer Graphics, pp. 289-300. ACM, 2001.

  • Rajlich, V. Absolutely parallel grammars and two-way deterministic finite state transducers. In Third Annual ACM Symposium on the Theory of Computing, pp. 132-137. ACM, 1971.

  • Rajlich, V. Absolutely parallel grammars and two-way deterministic finite state transducers. Journal of Computer and System Sciences 6: 324-342, 1972.

    Google Scholar 

  • Reinhardt, K. A parallel contextfree derivation hierarchy. In Fundamentals of Computation Theory, FCT, volume 1684 of LNCS, pp. 441-450. Springer, Berlin, 1999.

    Google Scholar 

  • Rosebrugh, R.D. and D. Wood. A characterization theorem for n-parallel right linear languages. Journal of Computer and System Sciences 7: 579-582, 1973.

    Google Scholar 

  • Rosebrugh, R.D. and D. Wood. Image theorems for simple matrix languages and n-parallel languages. Mathematical Systems Theory 8: 150-155, 1974.

    Google Scholar 

  • Rosebrugh, R.D. and D. Wood. Restricted parallelism and right linear grammars. Utilitas Mathematica 7: 151-186, 1975.

    Google Scholar 

  • Rosenberg, A.L. On multi-head finite automata. IBM Journal of Research and Development 10: 388-394, 1966.

    Google Scholar 

  • Rozenberg, G. T0L systems and languages. Information and Control (now Information and Computation) 23: 357-381, 1973.

    Google Scholar 

  • Rozenberg, G., K. Ruohonen and A.K. Salomaa. Developmental systems with fragmentation. International Journal of Computer Mathematics 5: 177-191, 1976.

    Google Scholar 

  • Rozenberg, G. and A. Salomaa, editors. L Systems, volume 15 of LNCS, chapter P. G. Doucet: The syntactic inference problem for D0L-sequences, pp. 146-161. Springer, Berlin, 1974.

  • Rozenberg, G. and A. Salomaa, editors. L Systems, volume 15 of LNCS, chapter A. Walker: Adult languages of L systems and the Chomsky hierarchy, pp. 201-215. Springer, Berlin, 1974.

  • Rozenberg, G. and A. Salomaa, editors. L Systems, volume 15 of LNCS, chapter Čulik, II, K. and J. Opatrn?: Context in parallel rewriting, pp. 230-243. Springer, Berlin, 1974.

  • Rozenberg, G. and A. Salomaa, editors. L Systems, volume 15 of LNCS, chapter S. Skyum: Nonterminals and codings defining varations of 0L-systems, pp. 244-249. Springer, Berlin, 1974.

  • Rozenberg, G. and A. Salomaa, editors. L Systems, volume 15 of LNCS, chapter D. Wood: Bounded parallelism and regular languages, pp. 292-301. Springer, Berlin, 1974.

  • Rozenberg, G. and A. K. Salomaa. The Mathematical Theory of L Systems. Academic Press, New York, 1980.

    Google Scholar 

  • Rozenberg, G. and A. Salomaa, editors. Handbook of Formal Languages (3 volumes). Springer, Berlin, 1997.

    Google Scholar 

  • Rozenberg, G. and D. Vermeir. On ET0L systems of finite index. Information and Control (now Information and Computation) 38: 103-133, 1978a.

    Google Scholar 

  • Rozenberg, G. and D. Vermeir. On the effect of the finite index restriction on several families of grammars.Information and Control (now Information and Computation) 39: 284-302, 1978b.

    Google Scholar 

  • Rosenkrantz, D.J. Programmed grammars and classes of formal languages. Journal of the ACM 16(1): 107-131, 1969.

    Google Scholar 

  • Ruhl, M. and H. Hartenstein. Optimal fractal coding is NP-hard. In Storer, J.A. and M. Cohn, editors, Proceedings of the 7th Data Compression Conference, DCC'97. IEEE Computer Society Press, pp. 261-270, 1997.

    Google Scholar 

  • Salomaa, K. Hierarchy of k-context-free languages. International Journal of Computer Mathematics 26: 69-90, 193-205, 1989.

    Google Scholar 

  • Sayood, K. Introduction to Data Compression. Morgan Kaufmann, San Francisco, CA, 1996.

    Google Scholar 

  • Seemann, M. Multiple-limited ET0L systems. In Bozapalidis, S., editor, Proceedings of the 3rd International Conference Developments in Language Theory, pp. 377-385. Aristotle University, Thessaloniki, 1997.

  • Siromoney, R. On equal matrix languages. Information and Control (now Information and Computation) 14: 133-151, 1969.

    Google Scholar 

  • Siromoney, R. and K. Krithivasan. Parallel context-free languages. Information and Control (now Information and Computation) 24: 155-162, 1974.

    Google Scholar 

  • Smith III, A.R. Two-dimensional formal languages and pattern recognition by cellular automata. In 12th Annual IEEE Symposium on Switching and Automata Theory, pp. 144-152. IEEE, 1971.

  • Smith III., A.R. Real-time language recognition by one-dimensional cellular automata. Journal of Computer and System Sciences 6: 233-253, 1972.

    Google Scholar 

  • Smith III, A.R. Introduction to and survey of polyautomata theory. In Lindenmayer, A. and G. Rozenberg, editors, Automata, Languages, Development, pp. 405-422. North-Holland, Amsterdam, 1976.

    Google Scholar 

  • Spilker, H. and D. Wätjen. Some undecidability results concerning k-limited 0L systems. Fundamenta Informaticae 26: 23-30, 1996.

    Google Scholar 

  • Stotskii, E.D. Formal grammars and constraints on derivation, Problemy peredachi informacii; translated: Problems of Information Transmission 7(1): 69-81, 1971 (translation 1973). Straubing, H. Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Basel, 1994.

    Google Scholar 

  • Sudborough, I.H. On tape-bounded complexity classes and multi-head finite automata. Journal of Computer and System Sciences 10(1): 62-76, 1975.

    Google Scholar 

  • Suppes, P., L. Henkin, Joja and G. Moisil, editors. Logic, Methodology, and Philosophy of Science, volume 4, chapter A. Lindenmayer: Cellular automata, formal languages and developmental systems, pp. 677-691. North-Holland, Amsterdam, 1973.

  • Takada, Y. Learning even equal matrix languages based on control sets. In Nakamura, A., M. Nivat, A. Saoudi, P.S.-P. Wang and K. Inoue, editors, Parallel Image Analysis, ICPIA'92, volume 652 of LNCS, pp. 274-289. Springer, Berlin, 1992.

    Google Scholar 

  • Takahashi, S. Self-similarity of linear cellular automata. Journal of Computer and System Sciences 44: 114-140, 1992.

    Google Scholar 

  • Terrier, V. On real time one-way cellular array. Theoretical Computer Science 141: 331-335, 1995.

    Google Scholar 

  • Terrier, V. Language not recognizable in real time by one-way cellular automata. Theoretical Computer Science 156(1-2): 281-287, 1996.

    Google Scholar 

  • Turing, A.M. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 2(42): 230-265, 1936. (Corrections on volume 2(43): 544-546.)

    Google Scholar 

  • Valiant, L.G. A theory of the learnable. Communications of the ACM 27: 1134-1142, 1984.

    Google Scholar 

  • Vaszil, Gy. Various communications in parallel communicating grammar systems. Acta Cybernetica 13: 173-196, 1997.

    Google Scholar 

  • Vaszil, Gy. Communication in parallel communicating Lindenmayer systems. Grammars 1(3): 255-270, 1999a. Special Issue on Grammar Systems. Guest editor: J. Kelemen.

  • Vaszil, Gy. On parallel communicating Lindenmayer systems. In Păun, Gh. and A. Salomaa, editors. Grammatical Models of Multi-Agent Systems, pp. 99-112. Gordon and Breach, London, 1999b.

    Google Scholar 

  • Vaszil, Gy. On the generative capacity of parallel communicating extended Lindenmayer systems. In Martín-Vide, C. and V. Mitrana, editors. Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back, pp. 99-107. Taylor and Francis, London, 2003.

    Google Scholar 

  • Vidal, E. and M.J. Castro. Classification of banded chromosomes using error-correcting grammatical inference (ECGI) and multilayer perceptron (MLP). In VIIth National Symposium on Pattern Recognition and Image Analysis, pp. 31-36. Centre de Visió per Computador, Bellaterra, 1997.

    Google Scholar 

  • Vitányi, P.M.B. Lindenmayer systems: Structure, languages, and growth functions. Technical Report 96, Mathematisch Centrum, Amsterdam, 1980.

    Google Scholar 

  • Vitányi, P.M.B. Development, growth and time. In Rozenberg, G. and A. Salomaa, editors. The Book of L, pp. 431-444. Springer, Berlin, 1985.

    Google Scholar 

  • Vollmar, R. Algorithmen in Zellularautomaten, volume 48 of LAMM. Teubner, Stuttgart, 1979.

    Google Scholar 

  • Wang, P.S.-P. Parallel context-free array grammar normal forms. Computer Graphics and Image Processing 15: 296-300, 1981.

    Google Scholar 

  • Wang, P.S.-P. A new hierarchy of two-dimensional array languages. Information Processing Letters 15: 223-226, 1982.

    Google Scholar 

  • Wätjen, D. k-limited 0L systems and languages. Journal of Information Processing and Cybernetics EIK (formerly Elektron. Inf.verarb. Kybern.) 24(6): 267-285, 1988.

    Google Scholar 

  • Wätjen. D. On k-uniformly-limited T0L systems and languages. Journal of Information Processing and Cybernetics EIK (formerly Elektron. Inf. verarb. Kybern.) 26(4): 229-238, 1990.

    Google Scholar 

  • Wätjen, D. Restriction of active symbols in k-limited ET0L systems and a normal form theorem. International Journal of Computer Mathematics 40: 47-62, 1991.

    Google Scholar 

  • Wätjen, D. A weak iteration theorem for k-limited E0L systems. Journal of Information Processing and Cybernetics. EIK (formerly Elektron. Inf.verarb. Kybern.) 28(1): 37-40, 1992.

    Google Scholar 

  • Wätjen, D. Regulation of k-limited ET0L systems. International Journal of Computer Mathematics 47: 29-41, 1993.

    Google Scholar 

  • Wätjen, D. Regulation of uniformly k-limited T0L systems. Journal of Information Processing and Cybernetics EIK (formerly Elektron. Inf.verarb. Kybern.) 30(3): 169-187, 1994.

    Google Scholar 

  • Wätjen, D. On regularly controlled k-limited T0L systems. International Journal of Computer Mathematics 55: 57-66, 1995.

    Google Scholar 

  • Wätjen, D. Regulations of uniformly k-limited ET0L systems and their relations to controlled context-free grammars. Journal of Automata, Languages and Combinatorics 1(1): 55-74, 1996.

    Google Scholar 

  • Wätjen, D. k-limited ED0L languages are context-sensitive. Bulletin of the EATCS 61: 89-91, 1997.

    Google Scholar 

  • Wätjen, D. Teams of limited and uniformly limited 0L systems. Journal of Automata, Languages and Combinatorics 4(1): 31-57, 1999.

    Google Scholar 

  • Wätjen, D. Undecidability results for uniformly k-limited 0L systems. Journal of Automata, Languages and Combinatorics 5(2): 159-167, 2000.

    Google Scholar 

  • Wätjen, D. Parallel communicating limited and uniformly limited 0L systems. Theoretical Computer Science 255(1-2): 163-191, 2001.

    Google Scholar 

  • Wätjen, D. and D. Ostrovsky. Function-limited 0L systems revisited. Journal of Automata, Languages and Combinatorics 6(1): 97-114, 2001.

    Google Scholar 

  • Wätjen, D. and E. Unruh. On the degree of synchronization of klET0L systems. Information Processing Letters 29: 87-89, 1988.

    Google Scholar 

  • Wood, D. n-linear simple matrix languages and n-parallel linear languages. Revue Roumaine des Mathématiques Pures et Appliquées 22: 403-412, 1977.

    Google Scholar 

  • Worsch, Th. Komplexitätstheoretische Untersuchungen an myopischen Polyautomaten. PhD thesis, TU Braunschweig, 1990.

  • Yamamoto, Y., K. Morita and K. Sugata. Context-sensitivity of two-dimensional regular array grammars. International Journal of Pattern Recognition and Artificial Intelligence 3: 295-319, 1989.

    Google Scholar 

  • Yokomori, T. Inductive inference of 0L languages. In Lindenmayer Systems, pp. 115-132. Springer, Berlin, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, University of Newcastle, University Drive, Callaghan, NSW, 2308, Australia

    Henning Fernau

  2. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076, Tübingen, Germany

    Henning Fernau

Authors
  1. Henning Fernau
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fernau, H. Parallel Grammars: A Phenomenology. Grammars 6, 25–87 (2003). https://doi.org/10.1023/A:1024087118762

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024087118762

Search

Navigation