Bibliography

AdlemanAdleman1994

Adleman, L. (1994).
Molecular computation of solutions to combinatorial problems.
Science 266, 1021-1024.

BrooksBrooks1999

Brooks, R. A. (1999).
Cambrian Intelligence: The Early History of the new AI.
MIT Press, Cambridge, Mass.

CsimaCsima1997

Csima, J. (1997).
Formal language theoretical models of ecosystems (in Hungarian).
Master's thesis, Eötvös Loránd University, Budapest, Hungary.

CsimaCsima1998a

Csima, J. (1998a).
On extended simple eco-grammar systems.
Acta Cybernetica 13(4), 359-373.

CsimaCsima1998b

Csima, J. (1998b).
On hybrid eco-rewriting systems.
In A. Kelemenová (Ed.), Proceedings of the MFCS'98 Satellite Workshop on Grammar Systems, pp. 215-234. Silesian University, Opava.

CsimaCsima1999

Csima, J. (1999).
On hybrid eco-rewriting systems.
Grammars 1(3), 239-253.

CsimaCsima2000

Csima, J. (2000).
Two remarks on variants of simple eco-grammar systems.
Acta Cybernetica 14(4), 569-582.

Csima, Csuhaj-Varjú, and SalomaaCsima et al.2001

Csima, J., E. Csuhaj-Varjú, and A. Salomaa (2001).
Power and size of extended Watson-Crick L systems.
Technical Report 424, Turku Centre for Computer Science, Turku.
To appear in Theoretical Computer Science.

Csuhaj-VarjúCsuhaj-Varjú1995

Csuhaj-Varjú, E. (1995).
Eco-grammar systems: Recent results and perspectives.
In Gh. Paun (Ed.), Artificial Life: Grammatical Models, pp. 79-103. Black Sea University Press, Bucharest.

Csuhaj-VarjúCsuhaj-Varjú1996

Csuhaj-Varjú, E. (1996).
Generalized eco-grammar systems: a framework for natural language generation.
In C. Martin-Vide (Ed.), XIIth Congress on Natural and Formal Languages, pp. 13-27. Barcelona.

Csuhaj-VarjúCsuhaj-Varjú1999

Csuhaj-Varjú, E. (1999).
Colonies: A multi-agent approach to language generation.
In A. Kornai (Ed.), Extended Finite State Models of Language, Studies in Natural Language Processing, pp. 208-225. Cambridge University Press, Cambridge, Mass.

Csuhaj-VarjúCsuhaj-Varjú1999

Csuhaj-Varjú, E. (1999).
Grammar systems with bounded resources: on size complexity of grammar systems.
In J. Dassow and D. Wotschke (Eds.), Proceedings of the International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Magdeburg, 1999, pp. 9-22. Otto-von-Guericke University.

Csuhaj-VarjúCsuhaj-Varjú2000

Csuhaj-Varjú, E. (2000).
Grammar systems: 12 years, 12 problems (short version).
In R. Freund and A. Kelemenová (Eds.), Proceedings of the International Workshop on Grammar Systems 2000, pp. 77-92. Silesian University, Opava.

Csuhaj-Varjú and DassowCsuhaj-Varjú and Dassow1990

Csuhaj-Varjú, E. and J. Dassow (1990).
On cooperating/distributed grammar systems.
Journal of Information Processing and Cybernetics  26(1-2), 49-63.
4th Workshop on Mathematical Aspects of Computer Science, Magdeburg, 1988.

Csuhaj-Varjú, Dassow, Kelemen, and PaunCsuhaj-Varjú et al.1994

Csuhaj-Varjú, E., J. Dassow, J. Kelemen, and Gh. Paun (1994).
Grammar Systems: A Grammatical Approach to Distribution and Cooperation, Volume 5 of Topics in Computer Mathematics.
Gordon and Breach, London.

Csuhaj-Varjú and Jiménez-LópezCsuhaj-Varjú and Jiménez-López1998

Csuhaj-Varjú, E. and M. D. Jiménez-López (1998).
Cultural eco-grammar systems: A multi-agent system for cultural change.
In A. Kelemenová (Ed.), Proceedings of the MFCS'98 Satellite Workshop on Grammar Systems, pp. 165-182. Silesian University, Opava.

Csuhaj-Varjú, Jiménez-López, and Martín-VideCsuhaj-Varjú et al.1999

Csuhaj-Varjú, E., M. D. Jiménez-López, and C. Martín-Vide (1999).
Pragmatics and eco-rewriting systems.
In Gh. Paun and A. Salomaa (Eds.), Grammatical Models of Multi-Agent Systems, pp. 262-283. Gordon and Breach, London.

Csuhaj-Varjú and KelemenCsuhaj-Varjú and Kelemen1989

Csuhaj-Varjú, E. and J. Kelemen (1989).
Cooperating grammar systems: A syntactical framework for the blackboard model of problem solving.
In I. Plander (Ed.), Proceedings of the Conference on Artificial Intelligence and Information Control Systems of Robots, 1989, pp. 121-127. North-Holland, Amsterdam.

Csuhaj-Varjú, Kelemen, Kelemenová, and PaunCsuhaj-Varjú et al.1994

Csuhaj-Varjú, E., J. Kelemen, A. Kelemenová, and Gh. Paun (1994).
Eco(grammar) systems. A preview.
In R. Trappl (Ed.), Proceedings of the 12th European Meeting on Cybernetics and Systems Research, pp. 941-948. World Scientific, Singapore.

Csuhaj-Varjú, Kelemen, Kelemenová, and PaunCsuhaj-Varjú et al.1997

Csuhaj-Varjú, E., J. Kelemen, A. Kelemenová, and Gh. Paun (1997).
Eco-grammar systems: A grammatical framework for studying lifelike interactions.
Artificial Life 3, 1-28.

Csuhaj-Varjú and KelemenováCsuhaj-Varjú and Kelemenová1994

Csuhaj-Varjú, E. and A. Kelemenová (1994).
Languages of colonies.
Theoretical Computer Science 134, 119-130.

Csuhaj-Varjú and KelemenováCsuhaj-Varjú and Kelemenová1998

Csuhaj-Varjú, E. and A. Kelemenová (1998).
Team behaviour in eco-grammar systems.
Theoretical Computer Science 209(1-2), 213-224.

Csuhaj-Varjú, Paun, and SalomaaCsuhaj-Varjú et al.1995

Csuhaj-Varjú, E., Gh. Paun, and A. Salomaa (1995).
Conditional tabled eco-grammar systems versus (E)T0L systems.
Journal of Universal Computer Science 5(1), 252-268.

Csuhaj-Varjú and SalomaaCsuhaj-Varjú and Salomaa1998

Csuhaj-Varjú, E. and A. Salomaa (1998).
Networks of language processors: Parallel communicating systems.
EATCS Bulettin 66, 122-138.

Csuhaj-Varjú and SalomaaCsuhaj-Varjú and Salomaa2000

Csuhaj-Varjú, E. and A. Salomaa (2000).
Networks of Watson-Crick D0L systems.
In M. Ito (Ed.), Proceedings of the 3rd International Colloquium on Words, Languages and Combinatorics. World Scientific, Singapore.

Dassow, Kelemen, and PaunDassow et al.1993

Dassow, J., J. Kelemen, and Gh. Paun (1993).
On parallelism in colonies.
Cybernetics and Systems 24, 37-49.

Dassow and MihalacheDassow and Mihalache1995

Dassow, J. and V. Mihalache (1995).
Eco-grammar systems, matrix grammars and E0L systems.
In Gh. Paun (Ed.), Artificial Life: grammatical models, pp. 210-226. Black Sea University Press, Bucharest.

Dassow and MitranaDassow and Mitrana1997

Dassow, J. and V. Mitrana (1997).
Evolutionary grammars: A grammatical model for genome evolution.
In R. Hofestädt, T. Lengauer, M. Löffler, and D. Scomburg (Eds.), Bioinformatics (Proceedings of the German Conference on Bioinformatics), Volume 1278 of Lecture Notes in Computer Science, pp. 199-209. Springer-Verlag, Berlin.

Dassow and PaunDassow and Paun1989

Dassow, J. and Gh. Paun (1989).
Regulated Rewriting in Formal Language Theory.
Springer-Verlag, Berlin.

Dassow, Paun, and RozenbergDassow et al.1997

Dassow, J., Gh. Paun, and G. Rozenberg (1997).
Grammar systems.
In A. Salomaa (Ed.), Handbook of Formal Languages, Volume 2, Chapter 4, pp. 155-213. Springer-Verlag, Berlin.

Ehrenfeucht and RozenbergEhrenfeucht and Rozenberg1976

Ehrenfeucht, A. and G. Rozenberg (1976).
On $\Theta$-determined E0L languages.
In A. Lindenmayer and G. Rozenberg (Eds.), Automata, Languages, Development. North-Holland, Amsterdam.

GeffertGeffert1988

Geffert, V. (1988).
Context-free-like forms for the phrase-structure grammars.
In Proceedings of MFCS'88, Volume 324 of Lecture Notes in Computer Science, pp. 309-317. Springer-Verlag, Berlin.

Honkala and SalomaaHonkala and Salomaa2001

Honkala, J. and A. Salomaa (2001).
Watson-Crick D0L systems with regular triggers.
Theoretical Computer Science 259(1-2), 689-698.

Jiménez-LópezJiménez-L´opez2000

Jiménez-López, M. D. (2000).
Grammar Systems: A Formal-Language-Theoretic Framework for Linguistics and Cultural Evolution.
Ph. D. thesis, Universitat Rovira í Virgili, Tarragona, Spain.

KariKari1991

Kari, L. (1991).
On Insertion and Deletion in Formal Languages.
Ph. D. thesis, University of Turku, Finland.

Kari, Mateescu, Paun, and SalomaaKari et al.1995

Kari, L., A. Mateescu, Gh. Paun, and A. Salomaa (1995).
Teams in cooperating grammar systems.
Journal of Experimental and Theoretical AI 7, 347-359.

Kari and ThierrinKari and Thierrin1996

Kari, L. and G. Thierrin (1996).
Contextual insertions/deletions and computability.
Information and Computation 131, 47-61.

KelemenKelemen1998

Kelemen, J. (1998).
Colonies - a theory of reactive agents.
In A. Kelemenová (Ed.), Proceedings of the MFCS'98 Satellite Workshop on Grammar Systems, pp. 7-38. Silesian University, Opava.

KelemenKelemen1999

Kelemen, J. (1999).
Why grammar systems?
Grammars 1(3), 271-280.

Kelemen and KelemenováKelemen and Kelemenová1992

Kelemen, J. and A. Kelemenová (1992).
A subsumption architecture for generative symbol systems.
In R. Trappl (Ed.), Cybernetics and Systems Research, pp. 1529-1536. World Scientific, Singapore.

LangtonLangton1989

Langton, C. G. (1989).
Artificial life.
In C. G. Langton (Ed.), Artificial Life, pp. 1-47. Addison-Wesley, Reading, Mass.

Meersman and RozenbergMeersman and Rozenberg1978

Meersman, R. and G. Rozenberg (1978).
Cooperating grammar systems.
In Proceedings of MFCS'78, Volume 64 of Lecture Notes in Computer Science, pp. 364-373. Springer-Verlag, Berlin.

Mihalache and SalomaaMihalache and Salomaa1997

Mihalache, V. and A. Salomaa (1997).
Lindemayer and DNA: Watson-Crick D0L systems.
EATCS Bulettin 62, 160-175.

Mihalache and SalomaaMihalache and Salomaa2001

Mihalache, V. and A. Salomaa (2001).
Language theoretic aspects of DNA complementarity.
Theoretical Computer Science 250(1-2), 163-178.

NiiNii1989

Nii, P. (1989).
Blackboard systems.
In A. Barr, P. Cohen, and E. Feigenbaum (Eds.), The Handbook of AI, Volume 4. Addison-Wesley, Reading, Mass.

Paun, Rozenberg, and SalomaaPaun et al.1998

Paun, Gh., G. Rozenberg, and A. Salomaa (1998).
DNA Computing - New Computing Paradigms.
EATCS Text Series. Springer-Verlag, Berlin.

Paun and SânteanPaun and Sântean1989

Paun, Gh. and L. Sântean (1989).
Parallel communicating grammar systems: The regular case.
Annals of the University of Bucharest 38(2), 55-63.
Mathematics-Informatics Series.

Rozenberg and SalomaaRozenberg and Salomaa1980

Rozenberg, G. and A. Salomaa (1980).
The Mathematical Theory of L-systems.
Academic Press.

Rozenberg and SalomaaRozenberg and Salomaa1996

Rozenberg, G. and A. Salomaa (1996).
Watson-Crick complementarity, universal computations and genetic engineeering.
Technical Report 96-28, Leiden University, Leiden.

SalomaaSalomaa1973

Salomaa, A. (1973).
Formal Languages.
Academic Press.

SalomaaSalomaa1998

Salomaa, A. (1998).
Turing, Watson-Crick and Lindenmayer; aspects of DNA complementarity.
In C. Calude, J. Casti, and M. Dinneen (Eds.), Unconventional Models of Computation, pp. 94-107. Springer-Verlag, Berlin.

SalomaaSalomaa1999

Salomaa, A. (1999).
Watson-Crick walks and roads on D0L graphs.
Acta Cybernetica 14(1), 179-192.

SalomaaSalomaa2001a

Salomaa, A. (2001a).
Iterated morphisms with complementarity on the DNA alphabet.
Technical Report 390, Turku Centre for Computer Science, Turku.
To appear in Lecture Notes in Computer Science.

SalomaaSalomaa2001b

Salomaa, A. (2001b).
Uni-transitional Watson-Crick D0L systems.
Technical Report 389, Turku Centre for Computer Science, Turku.
To appear in Theoretical Computer Science.

SosikSosik1999

Sosik, P. (1999).
On the hierarchy of extended conditional tabled eco-grammar systems.
Grammars 1(3), 225-238.

SosikSosik2001

Sosik, P. (2001).
D0L system+Watson-Crick complementarity= universal computation.
In M. Margenstern and Y. Rogozhin (Eds.), Machines, Computations and Universality. Proceedings of the Third International Conference MCU 2001, Volume 2055 of Lecture Notes in Computer Science, pp. 308-319. Springer-Verlag, Berlin.

ter Beekter Beek1999

ter Beek, M. H. (1999).
Simple eco-grammar systems with prescribed teams.
In Gh. Paun and A. Salomaa (Eds.), Grammatical Models of Multi-Agent Systems, pp. 113-135. Gordon and Breach, London.

VaszilVaszil2000

Vaszil, Gy. (2000).
Investigations on Parallel Communicating Grammar Systems.
Ph. D. thesis, Eötvös Loránd University, Budapest, Hungary.