Major Publications of G. Rozenberg in Periodicals#

Introducing time in reaction systems, Theoretical Computer Science 410, 310-322 (with A. Ehrenfeucht), 2009.

Membrane Systems with Proteins Embedded in Membranes, Theoretical Computer Science 404, 26-39 (with R. Brijder, M. Cavaliere, A. Riscos-Núñez, D. Sburlan), 2008.

Patterns of simple gene assembly in ciliates, Discrete Applied Mathematics 156, 2581-2597 (with T. Harju, I. Petre, V. Rogojin), 2008.

The many facets of natural computing, Communications of the ACM 51, 72-83 (with L. Kari), October 2008.

The Pathway to Detangle a Scrambled Gene, PLoS ONE 3, e2330 (with M. Möllenbeck, Y. Zhou, A.R.O. Cavalcanti, F. Jönsson, B.P. Higgins, W.-J. Chang, S. Juranek, T.G. Doak, H.J. Lipps, L.F. Landweber), 2008.

Multiset-Based Self-Assembly of Graphs, Fundamenta Informaticae 75, 49-75 (with F. Bernardini, R. Brijder, C. Zandron), 2007.

Membrane Systems with Marked Membranes, Electronic Notes in Theoretical Computer Science 171, 25-36 (with R. Brijder, M. Cavaliere, A. Riscos-Núñez, D. Sburlan), 2007.

From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates, LNCS 4639, 149-160, Springer Verlag (with R. Brijder, H.J. Hoogeboom), 2007.

Finite metrics in switching classes, Discrete Applied Mathematics 155, 68-73 (with A. Ehrenfeucht, T. Harju), 2007.

A model for the origin of internal eliminated segments (IESs) and gene rearrangement in stichotrichous ciliates, Journal of Theoretical Biology 244, 108-114 (with A. Ehrenfeucht, D.M. Prescott), 2007.

Biochemical Reactions as Computations, in: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007 (S.B. Cooper, Benedikt Löwe, Andrea Sorbi, eds.), 672-673 (with A. Ehrenfeucht), 2007.

Reaction Systems, Fundamenta Informaticae 75, 263 - 280 (with A. Ehrenfeucht), 2007.

Events and modules in reaction systems, Theoretical Computer Science 376, 3-16 (with A. Ehrenfeucht), 2007.

Complexity measures for gene assembly, LNCS 4366, 42-60, Springer Verlag (with T. Harju, C. Li, I. Petre), 2007.

Cycles and Communicating Classes in Membrane Systems and Molecular Dynamics, Theoretical Computer Science 372, 242-266 (with M. Muskulus, D. Besozzi, R. Brijder, P. Cazzaniga, S. Houweling, D. Pescini), 2007.

Computing morphisms by spiking neural P systems, International Journal of Foundations of Computer Science 18, 1371-1382 (with G. Paun, M.J. Pérez-Jiménez), 2007.

Computer Science, Informatics, and Natural Computing - Personal Reflections, in: New Computational Paradigms - Changing Conceptions of What is Computable (S.B. Cooper, B. Löwe, A. Sorbi, eds.), Springer, , 2007.

Workshop on Petri Nets and Graph Transformations, LNCS 4178, 467-469, Springer Verlag (with P. Baldan, H. Ehrig, J. Padberg), 2006.

Formalizing Spherical Membrane Structures and Membrane Proteins Populations, LNCS 4361, 18-41, Springer Verlag (with D. Besozzi), 2006.

Communication Membrane Systems with Active Symports, Journal of Automata, Languages and Combinatorics 11, 241-261 (with R. Brijder, M. Cavaliere, A. Riscos-Núñez, D. Sburlan), 2006.

Membrane systems with external control, LNCS 4361, 219-237, Springer Verlag (with R. Brijder, M. Cavaliere, A. Riscos-Núñez, D. Sburlan), 2006.

Reducibility of Gene Patterns in Ciliates using the Breakpoint Graph, Theoretical Computer Science 356, 26-45 (with R. Brijder, H.J. Hoogeboom), 2006.

Interpreted trajectories, Fundamenta Informaticae 73, 81-97 (with M. Domaratzki, K. Salomaa), 2006.

The embedding problem for switching classes of graphs, Fundamenta Informaticae 74, 115-134 (with A. Ehrenfeucht, J. Hage, T. Harju), 2006.

Embedding linear orders in grids, Acta Informatica 42, 419-428 (with A. Ehrenfeucht, T. Harju), 2006.

Covers from Templates, International Journal of Foundations of Computer Science 17, 475-488 (with A. Ehrenfeucht), 2006.

Computational Nature of Biochemical Reactions, LNCS 4036, 36, Springer Verlag (with A. Ehrenfeucht), 2006.

Contextual array grammars, in: Formal Models, Languages and Applications (K.G. Subramanian, K. Rangarajan, M. Mukund, eds.), World Scientific, Singapore, 112-136 (with R. Freund, Gh. Paun), 2006.

Parallelism in gene assembly, Natural Computing 5, 151-163 (with T. Harju, C. Li, I. Petre), 2006.

Simple operations for gene assembly, LNCS 3892, 96-111, Springer Verlag (with T. Harju, I. Petre, V. Rogojin), 2006.

Modelling simple operations for gene assembly, in: Nanotechnology: Science and Computation (J. Chen, N. Jonoska, G. Rozenberg, eds.), Natural Computing Series, Springer-Verlag, 361-376 (with T. Harju, I. Petre), 2006.

DNA computing of solutions to knapsack problems, Biosystems , (with C.V. Henkel, T. Bäck, J.N. Kok, H.P. Spaink), 2006.

Application of mismatch detection methods in DNA computing, Natural Computing 5, 203 - 223 (with C. Henkel, H. Spaink), 2006.

Process Semantics for Membrane Systems, Journal of Automata, Languages and Combinatorics 11, 321-340 (with J. Kleijn, M. Koutny), 2006.

Towards a Petri Net Semantics for Membrane Systems, LNCS 3850, 292-309, Springer Verlag (with J. Kleijn, M. Koutny), 2006.

Reaction Cycles in Membrane Systems and Molecular Dynamics, in: Proceedings of the Fourth Brainstorming Week on Membrane Computing, Volume II (C. Graciani Diaz, G. Paun, A. Romero-Jimenez, F. Sancho-Caparrini, eds.), RGNC Report, v. 03/2006, Research Group on Natural Computing, Sevilla University, (with M. Muskulus, S. Houweling, D. Besozzi, P. Cazzaniga, D. Pescini, R. Brijder), 2006.

Spike Trains in Spiking Neural P Systems, International Journal of Foundations of Computer Science 17, 975-1002 (with G. Paun, M.J. Pérez-Jiménez), 2006.

Theory Inspired by Gene Assembly in Ciliates, LNCS 4094, 10, Springer Verlag , 2006.

The construction of minimal DNA expressions, Natural Computing 5, 127-149 (with R. van Vliet, H.J. Hoogeboom), 2006.

The Breakpoint Graph in Ciliates, LNCS 3695, 128-139, Springer Verlag (with R. Brijder, H.J. Hoogeboom), 2005.

Protein output for DNA computing, Natural Computing 4, 1-10 (with C.V. Henkel, R.S. Bladergroen, C.I.A. Balog, A.M. Deelder, T. Head, H. Spaink), 2005.

Main Concepts of Networks of Transformation Units with Interlinking Semantics, LNCS 3393, 325-342, Springer Verlag (with D. Janssens, H.-J. Kreowski), 2005.

Combinatorial aspects of minimal DNA expressions, LNCS 3384, 375-388, Springer Verlag (with R. van Vliet, H.J. Hoogeboom), 2005.

Embedding in switching classes with skew gains, LNCS 3256, 257 - 270, Springer Verlag (with A. Ehrenfeucht, J. Hage, T. Harju), 2004.

Modelling Gene Assembly in Ciliates, in: Modelling in Molecular Biology (G. Ciobanu, G. Rozenberg, eds.), Natural Computing Series, Springer Verlag, 105-124 (with A. Ehrenfeucht, T. Harju, I. Petre, D.M. Prescott), 2004.

Zebra factorizations in free semigroups, Semigroup Forum , 365 - 372 (with A. Ehrenfeucht, T. Harju), 2004.

Transitivity of local complementation and switching on graphs, Discrete Mathematics 278, 45-60 (with A. Ehrenfeucht, T. Harju), 2004.

Basic Notions of Reaction Systems, LNCS 3340, 27-29, Springer Verlag (with A. Ehrenfeucht), 2004.

Flux systems, flows and self-assembly, in: Proceedings of the conference Foundations of Nanoscience: Self-Assembled Architectures and Devices, Snowbird, Utah, 2004 (J. Reif, ed.), ScienceTechnica, 59 (with A. Ehrenfeucht), 2004.

Parallelism in gene assembly, in: preliminary proceedings DNA10, June 2004, Milano (C. Ferretti, G. Mauri, C. Zandron, eds.), 74-83 (with T. Harju, C. Li, I. Petre), 2004.

Gene assembly in ciliates: Formal frameworks, Bulletin of the EATCS , (with T. Harju, I. Petre), 2004.

Formal properties of gene assembly: equivalence problem for overlap graphs, LNCS 2950, 202 - 212, Springer Verlag (with T. Harju, I. Petre), 2004.

Two Models for Gene Assembly in Ciliates, LNCS 3113, 89-101, Springer Verlag (with T. Harju, I. Petre), 2004.

Gene Assembly in Ciliates. Part I: Molecular Operations, in: Current Trends in Theoretical Computer Science -- The Challenge of the New Century, Formal Models and Semantics (vol. 2) (G. Paun, G. Rozenberg, A. Salomaa, eds.), World Scientific, New Jersey, 527-541 (with T. Harju, I. Petre), 2004.

Gene Assembly in Ciliates. Part II: Formal Frameworks, in: Current Trends in Theoretical Computer Science -- The Challenge of the New Century, Formal Models and Semantics (vol. 2) (G. Paun, G. Rozenberg, A. Salomaa, eds.), World Scientific, New Jersey, 543-557 (with T. Harju, I. Petre), 2004.

Application of mismatch detection methods in DNA computing, in: preliminary proceedings DNA10, June 2004, Milano (C. Ferretti, G. Mauri, C. Zandron, eds.), 183-192 (with C. Henkel, H. Spaink), 2004.

DNA Computing - Computer in de Reageerbuis, in: De wiskundige kat, de biologische muis en de jacht op inzicht (J.A.P. Heesterbeek, O. Diekmann, J.A.J. Metz, eds.), Epsilon deel 55, Epsilon Uitgaven Utrecht, (with H.J. Hoogeboom), 2004.

Encrypted Genes and Their Assembly in Ciliates, in: Cellular Computing (M. Amos, ed.), Systems Biology series, Oxford University Press, (with D.M. Prescott), 2004.

DNA computing using single-molecule hybridization detection, Nucleic Acids Research 32, 4962-4968 (with K.A. Schmidt, C.V. Henkel, H.P. Spaink), 2004.

Combinatorial Aspects of Minimal DNA Expressions, in: preliminary proceedings DNA10, June 2004, Milano (C. Ferretti, G. Mauri, C. Zandron, eds.), 84-96 (with R. van Vliet, H.J. Hoogeboom), 2004.

Evolutionary Computation as a Paradigm for DNA-Based Computing, in: Evolution as Computation, DIMACS Workshop, Princeton, January 1999 (L.F. Landweber, E. Winfree, eds.), Natural Computing Series, Springer, 15-40 (with Th. Bäck, J.N. Kok), 2003.

Synchronizations in Team Automata for Groupware Systems, Computer Supported Cooperative Work 12, 21 - 69 (with M.H. ter Beek, C.A. Ellis, J. Kleijn), 2003.

Formal systems for gene assembly in ciliates, Theoretical Computer Science 292, 199-219 (with A. Ehrenfeucht, T. Harju, I. Petre, D.M. Prescott), 2003.

Forbidding-enforcing systems, Theoretical Computer Science 292, 611-638 (with A. Ehrenfeucht), 2003.

Gene assembly in ciliates: Molecular operations, Bulletin of the EATCS , (with T. Harju, I. Petre), 2003.

Computational Processes in Living Cells: Gene Assembly in Ciliates, LNCS 2450, 1-20, Springer Verlag (with T. Harju), 2003.

Gheorghe Paun and the Windmill Curiosity, in: Grammars and Automata for String Processing: from Mathematics and Computer Science to Biology and Back (C. Martín-Vide, V. Mitrana, eds.), Topics in Computer Mathematics, v. 9, Taylor and Francis, London, 1-5 (with M. van der Nat), 2003.

Template-guided recombination for IES elimination and unscrambling of gemes in stichotrichous ciliates, Journal of Theoretical Biology 222, 323-330 (with D.M. Prescott, A. Ehrenfeucht), 2003.

DNA computing by blocking, Theoretical Computer Science 292, 653-665 (with H. Spaink), 2003.

Experimental Single-Molecule DNA Computing, in: Proceedings Ninth International Meeting on DNA Based Computers (DNA9), 1-4 June 2003, Madison, Wisconsin, USA (J. Chen, J. Reif, eds.), 191 (with K.A. Schmidt, C.V. Henkel, H.P. Spaink), 2003.

Topics in the theory of DNA computing, Theoretical Computer Science 287, 3-38 (with M. Amos, G. Paun, A. Salomaa), 2002.

Patterns of micronuclear genes in ciliates, LNCS 2340, 279-289, Springer Verlag (with A. Ehrenfeucht, T. Harju, I. Petre), 2002.

Characterizing the Micronuclear Gene Patterns in Ciliates, Theory of Computing Systems 35, 501-519 (with A. Ehrenfeucht, T. Harju, I. Petre), 2002.

Gene assembly through cyclic graph decomposition, Theoretical Computer Science 281, 325-349 (with A. Ehrenfeucht, T. Harju), 2002.

String and graph reduction systems for gene assembly in ciliates, Mathematical Structures in Computer Science 12, 113-134 (with A. Ehrenfeucht, I. Petre, D.M. Prescott), 2002.

Computational Aspects of Gene (Un)Scrambling in Ciliates, in: Evolution as Computation, DIMACS Workshop (L.F. Landweber, E. Winfree, eds.), Springer Verlag, 216-256 (with A. Ehrenfeucht, D.M. Prescott), 2002.

Tutorial on DNA Computing and Graph Transformation - Computational Nature of Gene Assembly in Ciliates, LNCS 2505, 430-434, Springer Verlag (with T. Harju, I. Petre), 2002.

Membrane Systems with Coupled Transport: Universality and Normal Forms, Fundamenta Informaticae 49, 1-15 (with C. Martín-Vide, G. Paun, A. Paun), 2002.

Membrane systems with carriers, Theoretical Computer Science 270, 779-796 (with C. Martín-Vide, G. Paun), 2002.

Computing by Communication in Networks of Membranes, International Journal of Foundations of Computer Science 13, 779-798 (with A. Paun, G. Paun), 2002.

A guide to membrane computing, Theoretical Computer Science 287, 73-100 (with A. Paun), 2002.

How ciliates manipulate their own DNA -- A splendid example of natural computing, Natural Computing 1, 165-183 (with D.M. Prescott), 2002.

Models of molecular computing based on molecular reactions, New Generation Computing 20, 237-249, 2002.

Gene Assembly in Ciliates - a beautiful sample of Natural Computing, Journal of Computational Methods in Sciences and Engineering 2, 35-41, 2002.

Membrane systems with promoters/inhibitors, Acta Informatica 38, 695-720 (with P. Bottoni, C. Martín-Vide, G. Paun, G. Rozenberg), 2002.

Team Automata for CSCW, in: Proceedings of the 2nd International Colloquium on Petri Net Technologies for Modelling Communication Based Systems (H. Weber, H. Ehrig, W. Reisig, eds.), Fraunhofer Institute for Software and Systems Engineering, Berlin, Germany, 1-20 (with M.H. ter Beek, C.A. Ellis, J. Kleijn), 2001.

Team Automata for Spatial Access Control, in: Proceedings of the 7th European Conference on Computer-Supported Cooperative Work (ECSCW 2001), Bonn, Germany, 2001 (W. Prinz, M. Jarke, Y. Rogers, K. Schmidt, V. Wulf, eds.), Kluwer Academic Publishers, Dordrecht, 59-77 (with M.H. ter Beek, C.A. Ellis, J. Kleijn), 2001.

Sequences of languages in forbidding-enforcing families, Soft Computing 5, 121-125 (with A. Ehrenfeucht, H.J. Hoogeboom, N. van Vugt), 2001.

Circularity and Other Invariants of Gene Assembly in Ciliates, in: Words, Semigroups, and Transductions, Festschrift in Honor of Gabriel Thierrin (M. Ito, G. Paun, S. Yu, eds.), World Scientific, Singapore, 81-98 (with A. Ehrenfeucht, I. Petre, D.M. Prescott), 2001.

Formal properties of PA-matching, Theoretical Computer Science 262, 117-131 (with S. Kobayashi, V. Mitrana, G. Paun), 2001.

Behavior and realization construction for Petrin nets based on free monoid and power set graphs, LNCS 2128, 230-249, Springer Verlag (with J. Padberg, H. Ehrig), 2001.

Hairpin Languages, International Journal of Foundations of Computer Science 12, 837-847 (with G. Paun, T. Yokomori), 2001.

Molecular operations for DNA processing in hypotrichous ciliates, European Journal of Protistology 37, 241-260 (with D.M. Prescott, A. Ehrenfeucht), 2001.

Gene Assembly in Ciliates: Computing by Folding and Recombination, in: A Half-Century of Automata Theory -- Celebration and Inspiration (A. Salomaa, D. Wood, S. Yu, eds.), World Scientific, New Jersey, 93-130, 2001.

String Tile Models for DNA Computing by Self-Assembly, LNCS 2054, 63-88, Springer Verlag (with E. Winfree, T. Eng), 2001.

Nonconventional Computing Paradigms in the New Millennium: A Roundtable, Computing in Science and Engineering , 82-99 (with A.Y. Zomaya, J.A. Anderson, D.B. Fogel, G.J. Milburn), November/December 2001.

Complexity Issues in Switching of Graphs, LNCS 1764, 59-70, Springer Verlag (with A. Ehrenfeucht, J. Hage, T. Harju), 2000.

Pancyclicity of switching classes, Information Processing Letters 73, 153-156 (with A. Ehrenfeucht, J. Hage, T. Harju), 2000.

Forbidding and Enforcing, in: DNA Based Computers V (E. Winfree, D. Gifford, eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, v. 54, 195-206 (with A. Ehrenfeucht, H.J. Hoogeboom, N. van Vugt), 2000.

Universal and Simple Operations for Gene Assembly in Ciliates, in: Where Mathematics, Computer Science and Biology Meet (C. Martin-Vide, V. Mitrana, eds.), Kluwer Academic Publishers, 329-342 (with A. Ehrenfeucht, I. Petre, D.M. Prescott), November 2000.

Double-Pullback Graph Transitions: a rule-based framework with incomplete information, LNCS 1764, 85-102, Springer Verlag (with H. Ehrig, R. Heckel, M. Llabrés, F. Orejas, J. Padberg), 2000.

Computing with DNA by operating on plasmids, Biosystems 57, 87-93 (with T. Head, R.S. Bladergroen, C.K.D. Breek, P.H.M. Lommerse, H.P. Spaink), 2000.

On Strongly Context-Free Languages, Discrete Applied Mathematics 103, 153-165 (with L. Ilie, G. Paun, A. Salomaa), 2000.

Uniformly scattered factors, in: Finite VS Infinite, Contributions to an Eternal Dilemma (C. Calude, G. Paun, eds.), Discrete Mathematics and Theoretical Computer Science, v. 243, Springer-Verlag, London UK, 187-198 (with L. Ilie, I. Petre), 2000.

A characterization of poly-slender context-free languages, R.A.I.R.O. -- Informatique Théorique et Applications 34, 77-86 (with L. Ilie, I. Petre), 2000.

Membrane Computing with External Output, Fundamenta Informaticae 41, 313-340 (with G. Paun, A. Salomaa), 2000.

Cross-fertilization between evolutionary computing and DNA-based computing, in: Proceedings of the 1999 Congress on Evolutionary Computing, 980-987 (with T. Bäck, J.N. Kok), 1999.

Watson-Crick Finite Automata, in: 3rd DIMACS Workshop on DNA Based Computers (H. Rubin, D.H. Wood, eds.), DIMACS series in discrete mathematics, v. 48, 297-327 (with R. Freund, G. Paun, A. Salomaa), 1999.

Contexts on Trajectories, International Journal of Computer Mathematics 73, 15-36 (with C. Martín-Vide, A. Mateescu, A. Salomaa), 1999.

X-Families: an approach to the study of families of syntactically similar languages, in: Issues in mathematical linguistics (C. Martín-Vide, ed.), Studies in Functional and Structural Linguistics, v. 47, John Benjamins, Amsterdam, 145-163 (with C. Martín-Vide, G. Paun, A. Salomaa), 1999.

Some properties of duplication grammars, Acta Cybernetica 14, 165-177 (with V. Mitrana), 1999.

DNA Computing: new ideas and paradigms, LNCS 1644, 106-118, Springer Verlag (with A. Salomaa), 1999.

Permutations, parenthesis words, and Schroeder numbers, Discrete Mathematics 190, 259-264 (with A. Ehrenfeucht, T. Harju, P. ten Pas), 1998.

On representing recursively enumerable languages by internal contextual languages, Theoretical Computer Science 205, 61-83 (with A. Ehrenfeucht, G. Paun), 1998.

Bidirectional sticker systems, in: Pacific Symposium on Biocomputing (R.B. Altman, A.K. Dunker, L. Hunter, T.E. Klein, eds.), v. 3, World Scientific, Singapore, 535-546 (with R. Freund, G. Paun, A. Salomaa), 1998.

DNA Computing, Sticker Systems, and Universality, Acta Informatica 35, 401-420 (with L. Kari, G. Paun, A. Salomaa, S. Yu), 1998.

Universality results for finite H systems and Watson-Crick finite automata, in: Computing with Bio-Molecules, Theory and Experiments (G. Paun, ed.), Springer Verlag, Singapore, 200-220 (with C. Martín-Vide, G. Paun, A. Salomaa), 1998.

Characterizations of RE languages starting from internal contextual languages, International Journal of Computer Mathematics 66, 179-197 (with A. Mateescu, G. Paun, A. Salomaa), 1998.

Simple splicing systems, Discrete Applied Mathematics 84, 145-163 (with A. Mateescu, G. Paun, A. Salomaa), 1998.

Shuffle on trajectories: Syntactic constraints (Fundamental Study), Theoretical Computer Science 197, 1-56 (with A. Mateescu, A. Salomaa), 1998.

Sticker systems, Theoretical Computer Science 204, 183-203 (with G. Paun), 1998.

Complementarity Versus Universality: Keynotes of DNA computing, Complexity 4, 14-19 (with G. Paun, A. Salomaa), 1998.

Elementary Net Systems, LNCS 1491, 12-121, Springer Verlag (with J. Engelfriet), 1998.

Grammar systems, in: Handbook of Formal Languages, Volume 2: Linear Modelling: Background and Application (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, 155-213 (with J. Dassow, G. Paun), 1997.

2-structures -- A framework for decomposition and transformation of graphs, in: Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations (G. Rozenberg, ed.), World Scientific, 401-478 (with A. Ehrenfeucht, T. Harju), 1997.

Invariants of inversive 2-structures on groups of labels, Mathematical Structures in Computer Science 7, 303-327 (with A. Ehrenfeucht, T. Harju), 1997.

Semantics of nonsequential tree-based computation schemes, Fundamenta Informaticae 29, 305-324 (with A. Ehrenfeucht, K. Salomaa), 1997.

Node Replacement Graph Grammars, in: Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations (G. Rozenberg, ed.), World Scientific, 1-94 (with J. Engelfriet), 1997.

L systems, in: Handbook of Formal Languages, Volume 1: Word, Language, Grammar (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, 253-328 (with L. Kari, A. Salomaa), 1997.

Shuffle-like operations on omega-words, LNCS 1218, 395-411, Springer Verlag (with A. Mateescu, G.D. Mateescu, A. Salomaa), 1997.

Geometric Transformations of Language Families: The Power of Symmetry, International Journal of Foundations of Computer Science 8, 1-14 (with A. Mateescu, A. Salomaa), 1997.

Syntactic and Semantic Aspects of Parallellism, LNCS 1337, 79-105, Springer Verlag (with A. Mateescu, A. Salomaa), 1997.

Contextual grammars and formal languages, in: Handbook of Formal Languages, Volume 2: Linear Modelling: Background and Application (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, 237-293 (with G. Paun), 1997.

Computing by splicing: Programmed and evolving splicing systems, in: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation (ICEC'97), 273-278 (with G. Paun, A. Salomaa), 1997.

Finite languages for the representation of finite graphs, Journal of Computer and System Sciences 52, 170-184 (with A. Ehrenfeucht, J. Engelfriet), 1996.

Group Based Graph Transformations and Hierarchical Representations of Graphs, LNCS 1073, 502-520, Springer Verlag (with A. Ehrenfeucht, T. Harju), 1996.

On representing RE languages by one-sided internal contextual languages, Acta Cybernetica 12, 217-233 (with A. Ehrenfeucht, A. Mateescu, Gh. Paun, A. Salomaa), 1996.

A note on binary grammatical codes of trees, Theoretical Computer Science 155, 425-438 (with A. Ehrenfeucht, P. ten Pas), 1996.

Linear Landscape of External Contextual Languages, Acta Informatica 33, 571-594 (with A. Ehrenfeucht, G. Paun), 1996.

Characterization and complexity of uniformly nonprimitive labeled 2-structures, Theoretical Computer Science 154, 247-282 (with J. Engelfriet, T. Harju, A. Proskurowski), 1996.

Pattern Systems, Theoretical Computer Science 154, 183-201 (with V. Mitrana, Gh. Paun, A. Salomaa), 1996.

Contextual Grammars: Parallellism and Blocking of Derivation, Fundamenta Informaticae 25, 381-398 (with G. Paun, A. Salomaa), 1996.

Restricted use of the splicing operation, International Journal of Computer Mathematics 60, 17-32 (with G. Paun, A. Salomaa), 1996.

Pattern Grammars, Journal of Automata, Languages and Combinatorics 1, 219-235 (with G. Paun, A. Salomaa), 1996.

Computing by Splicing, Theoretical Computer Science 168, 321-336 (with G. Paun, A. Salomaa), 1996.

Contextual Grammars: Deterministic Derivations and Growth Functions, Revue Roumaine de Mathématiques Pures et Appliquées 41, 83-108 (with G. Paun, A. Salomaa), 1996.

Grammatical Codes of Trees and Terminally Coded Grammars, Fundamenta Informaticae 23, 1-33 (with A. Ehrenfeucht, J. Engelfriet, P. ten Pas), 1995.

On the generative capacity of certain classes of contextual grammars, in: Mathematical Linguistics and Related Topics (G. Paun, ed.), Editura Academiei, 105-118 (with A. Ehrenfeucht, L. Ilie, G. Paun, A. Salomaa), 1995.

Dynamic change within workflow systems, in: Proceedings of the ACM Conference on Organisational Computing Systems, 10-21 (with C.A. Ellis, K. Keddara), 1995.

Dependence Graphs, in: The Book of Traces, World Scientific, 43-68 (with H.J. Hoogeboom), 1995.

Generalised DOL trees, Acta Cybernetica 12, 1-9 (with L. Kari, A. Salomaa), 1995.

Parikh prime words and GO-like territories, Journal of Universal Computer Science 1, 790-810 (with A. Mateescu, G. Paun, A. Salomaa), 1995.

Transition Systems, Event Structures and Unfoldings, Information and Computation 118, 191-207 (with M. Nielsen, P.S. Thiagarajan), 1995.

Grammars Based on the Shuffle Operation, Journal of Universal Computer Science 1, 67-82 (with G. Paun, A. Salomaa), 1995.

Hyperedge channels are abelian, Theoretical Computer Science 127, 387-393 (with A.H. Deutz, A. Ehrenfeucht), 1994.

Clans and regions in 2-structures, Theoretical Computer Science 129, 207-262 (with A.H. Deutz, A. Ehrenfeucht), 1994.

Quotients and Plane Trees of Group Labeled 2-Structures, in: GRAGRA'94 Proceedings, 247-251 (with A. Ehrenfeucht, T. Harju), 1994.

Incremental construction of 2-structures, Discrete Mathematics 128, 113-141 (with A. Ehrenfeucht, T. Harju), 1994.

An Introduction to Context-free Text Grammars, in: Developments in Language Theory, World Scientific, 357-369 (with A. Ehrenfeucht, H.J. Hoogeboom, P. ten Pas), 1994.

Combinatorial Properties of Dependence Graphs, Information and Computation 114, 315-328 (with A. Ehrenfeucht, H.J. Hoogeboom), 1994.

On the generative capacity of certain classes of contextual grammars, in: Mathematical Linguistics and Related Topics, The Publishing House of the Romanian Academy of Sciences, Bucharest, 105-118 (with A. Ehrenfeucht, L. Ilie, G. Paun, A. Salomaa), 1994.

Context-free Text Grammars, Acta Informatica 31, 161-206 (with A. Ehrenfeucht, P. ten Pas), 1994.

Properties of grammatical codes of trees, Theoretical Computer Science 125, 259-293 (with A. Ehrenfeucht, P. ten Pas), 1994.

Normal forms for contextual grammars, in: Mathematical Aspects of Natural and Formal Languages (G. Paun, ed.), World Scientific Series in Computer Science, v. 43, World Scientific Publishing, 79-95 (with A. Ehrenfeucht, G. Paun), 1994.

Dynamic labeled 2-structures, Mathematical Structures in Computer Science 4, 433-455 (with A. Ehrenfeucht), 1994.

Dynamic Labeled 2-Structures with Variable Domains, LNCS 812, 97-123, Springer Verlag (with A. Ehrenfeucht), 1994.

Square Systems, Fundamenta Informaticae 20, 75-111 (with A. Ehrenfeucht), 1994.

Semantics of Trees, Mathematical Systems Theory 27, 159-181 (with A. Ehrenfeucht, K. Salomaa), 1994.

Decomposition of Infinite Labeled 2-Structures, LNCS 812, 145-158, Springer Verlag (with T. Harju), 1994.

Reductions for Primitive 2-Structures, Fundamenta Informaticae 20, 133-144 (with T. Harju), 1994.

Structuring grammar systems by priorities and hierarchies, Acta Cybernetica 11, 189-204 (with V. Mitrana, G. Paun), 1994.

Prescribed teams of grammars, Acta Informatica 31, 525-537 (with G. Paun), 1994.

Contextual Grammars: Erasing Determinism, One-Sided Contexts, in: Developments in Language Theory, World Scientific, 370-388 (with G. Paun, A. Salomaa), 1994.

Marcus contextual grammars: modularity and leftmost derivations, in: Mathematical Aspects of Natural and Formal Languages (G. Paun, ed.), World Scientific Publishing, 375-392 (with G. Paun, A. Salomaa), 1994.

Handle-rewriting hypergraph grammars, Journal of Computer and System Sciences 46, 218-270 (with B. Courcelle, J. Engelfriet), 1993.

On the structure of recognizable languages of dependence graphs, R.A.I.R.O. -- Informatique Théorique et Applications 27, 7-22 (with A. Ehrenfeucht, H.J. Hoogeboom), 1993.

Combinatorial properties of texts, R.A.I.R.O. -- Informatique Théorique et Applications 27, 433-464 (with A. Ehrenfeucht, P. ten Pas), 1993.

T-structures, T-functions and texts, Theoretical Computer Science 116, 227-290 (with A. Ehrenfeucht), 1993.

An introduction to dynamic labeled 2-structures, LNCS 711, 156-173, Springer Verlag (with A. Ehrenfeucht), 1993.

Permutable transformation semigroups, Semigroup Forum 47, 123-125 (with T. Harju), 1993.

Computation Graphs for Actor Grammars, Journal of Computer and System Sciences 46, 60-90 (with D. Janssens, M. Lens), 1993.

Angular 2-structures, Theoretical Computer Science 92, 227-248 (with A. Ehrenfeucht), 1992.

Elementary transition systems, Theoretical Computer Science 96, 3-33 (with M. Nielsen, P.S. Thiagarajan), 1992.

Elementary transition systems and refinement, Acta Informatica 29, 555-578 (with M. Nielsen, P.S. Thiagarajan), 1992.

A survey of equivalence notions for net based systems, LNCS 609, 410-472, Springer Verlag (with L. Pomello, C. Simone), 1992.

Context-free handle-rewriting hypergraph grammars, LNCS 532, 253-268, Springer Verlag (with B. Courcelle, J. Engelfriet), 1991.

Grammatical codes of trees, Discrete Applied Mathematics 32, 103-129 (with A. Ehrenfeucht), 1991.

Net-based description of parallel object-based systems, or POTs and POPs, LNCS 489, 229-273, Springer Verlag (with J. Engelfriet, G. Leih), 1991.

Nonterminal separation in graph grammars, Theoretical Computer Science 82, 95-111 (with J. Engelfriet, G. Leih), 1991.

Graph grammars based on node rewriting: an introduction to NLC graph grammars, LNCS 532, 12-23, Springer Verlag (with J. Engelfriet), 1991.

Diamond properties of elementary net systems, Fundamenta Informaticae XIV, 287-300 (with H.J. Hoogeboom), 1991.

Structured transformations and computation graphs for actor grammars, LNCS 532, 446-460, Springer Verlag (with D. Janssens), 1991.

Vector controlled concurrent systems, Part II: Comparisons, Fundamenta Informaticae XIV, 1-38 (with N.W. Keesmaat, H.C.M. Kleijn), 1991.

Labeled 2-structures, LNCS 555, 268-282, Springer Verlag , 1991.

Post Correspondence Problem, in: Encyclopedia of Mathematics, v. 7, Kluwer Academic Publishers, 252-253 (with A. Salomaa), 1991.

The complexity of regular DNLC graph languages, Journal of Computer and System Sciences 40, 376-404 (with IJ.J. Aalbersberg, J. Engelfriet), 1990.

A Theory of 2-structures, Part I: clans, basic subclasses, and morphisms (Fundamental Study), Theoretical Computer Science 70, 277-303 (with A. Ehrenfeucht), 1990.

Theory of 2-structures, Part II: representation through labeled tree families (Fundamental Study), Theoretical Computer Science 70, 305-342 (with A. Ehrenfeucht), 1990.

Primitivity is hereditary for 2-structures (Fundamental Study), Theoretical Computer Science 70, 343-358 (with A. Ehrenfeucht), 1990.

Partial (set) 2-structures, Part I: Basic notions and the representation problem, Acta Informatica 27, 315-342 (with A. Ehrenfeucht), 1990.

Partial (set) 2-structures, Part II: State spaces of concurrent systems, Acta Informatica 27, 343-368 (with A. Ehrenfeucht), 1990.

A characterization of set representable labeled partial 2-structures through decompositions, Acta Informatica 28, 83-94 (with A. Ehrenfeucht), 1990.

Formalizing the behaviour of parallel object-based systems by Petri nets, in: Semantics for concurrency (M.Z. Kwiatkowska, M.W. Shields, R.M. Thomas, eds.), Workshops on Computing, Springer-Verlag, Berlin, 204-221 (with J. Engelfriet, G. Leih), 1990.

A comparison of boundary graph grammars and context-free hypergraph grammars, Information and Computation 84, 163-206 (with J. Engelfriet), 1990.

Vector controlled concurrent systems; Part I: Basic classes, Fundamenta Informaticae XIII, 275-316 (with N.W. Keesmaat, H.C.M. Kleijn), 1990.

On structured graph grammars; I, Information Sciences 52, 185-210 (with H.-J. Kreowski), 1990.

On structured graph grammars; II, Information Sciences 52, 221-246 (with H.-J. Kreowski), 1990.

Edge-label controlled graph grammars, Journal of Computer and System Sciences 40, 188-228 (with M.G. Main), 1990.

Behavioural notions for elementary net systems, Distributed Computing 4, 45-57 (with M. Nielsen, P.S. Thiagarajan), 1990.

Complexity theory, in: Encyclopedia of Mathematics, v. 2, Kluwer Academic Publishers, 280-283 (with A. Salomaa), 1990.

Cryptography, in: Encyclopedia of Mathematics, v. 2, Kluwer Academic Publishers, 466-468 (with A. Salomaa), 1990.

L-systems, in: Encyclopedia of Mathematics, v. 5, Kluwer Academic Publishers, 325-327 (with A. Salomaa), 1990.

Mathematical Theory of Computation, in: Encyclopedia of Mathematics, v. 6, Kluwer Academic Publishers, 146-148 (with A. Salomaa), 1990.

A characterization of state spaces of elementary net systems, in: J.W. de Bakker, 25 jaar semantiek, Liber Amicorum, C.W.I. Amsterdam, 193-201 (with A. Ehrenfeucht), april 1989.

Clans and the complexity of dependence graphs, in: A perspective in computer science (R. Narasimhan, ed.), World Scientific Publishing, 33-37 (with A. Ehrenfeucht), 1989.

Actor grammars, Mathematical Systems Theory 22, 75-107 (with D. Janssens), 1989.

Theory of traces, Theoretical Computer Science 60, 1-82 (with IJ.J. Aalbersberg), 1988.

Recording the use of memory in right-boundary grammars and push-down automata, Acta Informatica 25, 203-23 (with A. Ehrenfeucht, H.J. Hoogeboom), 1988.

Apex graph grammars and attribute grammars, Acta Informatica 25, 537-571 (with J. Engelfriet, G. Leih), 1988.

Restricting the complexity of regular DNLC languages, LNCS 291, 147-166, Springer Verlag (with IJ.J. Aalbersberg, J. Engelfriet), 1987.

On the structure of dependency graphs, in: Concurrency and nets Concurency and nets (K. Voss, H.J. Genrich, G. Rozenberg, eds.), Springer Verlag, 141-170 (with A. Ehrenfeucht), 1987.

Apex graph grammars, LNCS 291, 167-185, Springer Verlag (with J. Engelfriet, G. Leih), 1987.

Basic notions of actor grammars, LNCS 291, 280-298, Springer Verlag (with D. Janssens), 1987.

Handle NLC-grammars and RE languages, Journal of Computer and System Sciences 35, 192-205 (with M.G. Main), 1987.

Fundamentals of edge-label controlled graph grammars, LNCS 291, 411-426, Springer Verlag (with M.G. Main), 1987.

Behaviour of elementary net systems, LNCS 254, 60-95, Springer Verlag , 1987.

An introduction to the NLC way of rewriting graphs, LNCS 291, 55-66, Springer Verlag , 1987.

Combinatorial properties of boundary NLC grammars, Discrete Applied Mathematics 16, 59-73 (with E. Welzl), 1987.

On the membership problem for regular DNLC grammars, Discrete Applied Mathematics 13, 79-85 (with IJ.J. Aalbersberg, A. Ehrenfeucht), 1986.

Computations in coordinated pair systems, Fundamenta Informaticae IX, 445-480 (with A. Ehrenfeucht, H.J. Hoogeboom), 1986.

Coordinated pair systems; Part I: Dyck words and classical pumping, R.A.I.R.O. -- Informatique Théorique et Applications 20, 405-424 (with A. Ehrenfeucht, H.J. Hoogeboom), 1986.

Coordinated pair systems; Part II: Sparse structure of Dyck words and Ogden's Lemma, R.A.I.R.O. -- Informatique Théorique et Applications 20, 425-439 (with A. Ehrenfeucht, H.J. Hoogeboom), 1986.

On the active and full use of memory in right-boundary grammars and push-down automata, Theoretical Computer Science 48, 201-228 (with A. Ehrenfeucht, H.J. Hoogeboom), 1986.

Infinitary languages: basic theory and applications to concurrent systems, LNCS 224, 266-342, Springer Verlag (with H.J. Hoogeboom), 1986.

Neighbourhood-uniform NLC grammars, Computer Vision, Graphics and Image Processing 35, 131-151 (with D. Janssens), 1986.

The bounded degree problem for NLC grammars is decidable, Journal of Computer and System Sciences 33, 415-422 (with D. Janssens, E. Welzl), December 1986.

Petri nets: basic notions, structures, behaviour, LNCS 224, 585-668, Springer Verlag (with P.S. Thiagarajan), 1986.

Boundary NLC graph grammars - basic definitions, normal forms, and complexity, Information and Control 69, 136-167 (with E. Welzl), 1986.

Graph theoretic closure properties of the family of boundary NLC graph languages, Acta Informatica 23, 289-309 (with E. Welzl), 1986.

Traces, dependency graphs and DNLC grammars, Discrete Applied Mathematics 11, 299-306 (with IJ.J. Aalbersberg), 1985.

CTS systems and Petri nets, Theoretical Computer Science 40, 149-162 (with IJ.J. Aalbersberg), October 1985.

On coordinated rewriting, LNCS 199, 100-111, Springer Verlag (with A. Ehrenfeucht, H.J. Hoogeboom), 1985.

Adding global forbidding context to context-free grammars, Theoretical Computer Science 37(3), 337-360 (with A. Ehrenfeucht, H.C.M. Kleijn), December 1985.

Strong iterative pairs and the regularity of context-free languages, R.A.I.R.O. -- Informatique Théorique et Applications 19, 43-56 (with A. Ehrenfeucht), 1985.

Each regular code is included in a maximal regular code, R.A.I.R.O. -- Informatique Théorique et Applications 20, 89-96 (with A. Ehrenfeucht), 1985.

A morphic representation of E0L languages and other ET0L languages, Discrete Applied Mathematics 12, 115-122 (with A. Ehrenfeucht, K. Ruohonen), 1985.

On coordinated selective substitutions: Towards a unified theory of grammars and machines, Theoretical Computer Science 37(1), 31-50, May 1985.

On erasing in E0L forms, Discrete Applied Mathematics 12, 175-190 (with R. Verraedt), 1985.

On ambiguity in D0S systems, R.A.I.R.O. -- Informatique Théorique et Applications 18, 279-295 (with A. Ehrenfeucht, D. Haussler), 1984.

On D0S languages and D0S mappings, Semigroup Forum 29, 123-148 (with A. Ehrenfeucht, D. Haussler, P. Zeiger), 1984.

Restrictions on NLC graph grammars, Theoretical Computer Science 31(1-2), 211-223 (with A. Ehrenfeucht, M.G. Main), May 1984.

On regularity of languages generated by copying systems, Discrete Applied Mathematics 8, 313-317 (with A. Ehrenfeucht), 1984.

An easy proof of Greibach normal form, Information and Control 63, 190-199 (with A. Ehrenfeucht), December 1984.

On inherently ambiguous E0L languages, Theoretical Computer Science 28(1-2), 197-214 (with A. Ehrenfeucht, R. Verraedt), January 1984.

Generalized handle grammars and their relation to Petri nets, Journal of Information Processing and Cybernetics EIK 20, 179-206 (with H.J. Genrich, D. Janssens, P.S. Thiagarajan), 1984.

Direction independent context-sensitive grammars, Information and Control 63(1/2), 113-117 (with H.C.M. Kleijn, M. Penttonen, K. Salomaa), October/November 1984.

Note on node-rewriting graph grammars, Information Processing Letters 18, 21-24 (with H.-J. Kreowski), 20 January 1984.

Commutative one-counter languages are regular, Journal of Computer and System Sciences 29(1), 54-57 (with M. Latteux), August 1984.

Restricting the in-out structure of Petri nets. A language theoretic point of view, Fundamenta Informaticae VII, 151-190 (with R. Verraedt), 1984.

On simulation and propagating E0L forms, Theoretical Computer Science 29(1-2), 41-48 (with R. Verraedt), March 1984.

Boundary NLC grammars, in: Ninth colloquium on Trees in Algebra and Programming (B. Courcelle, ed.), Cambridge University Press, 257-270 (with E. Welzl), 1984.

Context-free normal systems and ETOL systems, Journal of Computer and System Sciences 26, 34-46 (with A. Ehrenfeucht, J. Engelfriet), 1983.

On regularity of context-free languages, Theoretical Computer Science 27, 311-332 (with A. Ehrenfeucht, D. Haussler), 1983.

On binary equality sets and a solutionn to the test conjecture in the binary case, Journal of Algorithms 85, 76-85 (with A. Ehrenfeucht, J. Karhumäki), 1983.

Repetition of subwords in D0L languages, Information and Control 59, 13-35 (with A. Ehrenfeucht), 1983.

On the subword complexity of m-free D0L languages, Information Processing Letters 17, 121-124 (with A. Ehrenfeucht), 1983.

On the separating power of E0L systems, R.A.I.R.O. -- Informatique Théorique et Applications 17, 13-22 (with A. Ehrenfeucht), 1983.

On the subword complexity of locally catenative D0L languages., Information Processing Letters 16(1), 7-9 (with A. Ehrenfeucht), 24 January 1983.

P.S. Thiagarajan Petri nets and their relation to graph grammars, LNCS 153, 115-129, Springer Verlag (with H.J. Genrich, D. Janssens), 1983.

Constrained Petri nets, Fundamenta Informaticae VI, 81-125 (with H.J.M. Goeman, L.P.J. Groenewegen, H.C.M. Kleijn), 1983.

Constrained Petri nets part II: Generalizations and extensions, Fundamenta Informaticae VI, 333-374 (with H.J.M. Goeman, L.P.J. Groenewegen, H.C.M. Kleijn), 1983.

Grammatical constructions in selective substitution grammars, Acta Cybernetica 6, 239-269 (with J. Gonczarowski, H.C.M. Kleijn), 1983.

Closure properties of selective substitution grammars part I, International Journal of Computer Mathematics 14, 19-42 (with J. Gonczarowski, H.C.M. Kleijn), 1983.

Closure properties of selective substitution grammars part II, International Journal of Computer Mathematics 14, 109-135 (with J. Gonczarowski, H.C.M. Kleijn), 1983.

Hypergraph systems and their extensions, R.A.I.R.O. -- Informatique Théorique et Applications 17, 163-196 (with D. Janssens), 1983.

Neighbourhood-uniform NLC grammars, in: Proceedings WG'83 (M. Nagl, J. Perl, eds.), 114-124 (with D. Janssens), 1983.

Hypergraph systems generating graph languages, LNCS 153, 172-185, Springer Verlag (with D. Janssens), 1983.

Graph grammars with node label controlled rewriting, LNCS 153, 186-205, Springer Verlag (with D. Janssens), 1983.

Multigrammars, International Journal of Computer Mathematics 12, 177-201 (with H.C.M. Kleijn), 1983.

On the generative power of regular pattern grammars, Acta Informatica 20, 391-411 (with H.C.M. Kleijn), 1983.

Chain code picture languages, LNCS 153, 232-244, Springer Verlag (with H.A. Maurer, E. Welzl), 1983.

Subset languages of Petri nets, in: Applications and Theory of Petri nets (A. Pagnoni, G. Rozenberg, eds.), Informatik Fachberichte, v. 66, 250-263 (with R. Verraedt), 1983.

Subset languages of Petri nets. Part I: The relationship to string languages and normal forms, Theoretical Computer Science 26, 301-326 (with R. Verraedt), 1983.

Subset languages of Petri nets. Part II: Closure properties, Theoretical Computer Science 27, 85-108 (with R. Verraedt), 1983.

The goodness of \{S,a\}-E0L forms is decidable, Discrete Applied Mathematics 6, 263-300 (with R. Verraedt), 1983.

Conditions enforcing regularity of context-free languages, LNCS 140, 187-191, Springer Verlag (with A. Ehrenfeucht, D. Haussler), July 1982.

The (generalized) Post Correspondence Problem with lists consisting of two words is decidable, Theoretical Computer Science 21(2), 119-144 (with A. Ehrenfeucht, J. Karhumäki), November 1982.

Representation theorems using D0S languages, Theoretical Computer Science 21(1), 75-90 (with A. Ehrenfeucht), October 1982.

On the subword complexity of homomorphic images of languages, R.A.I.R.O. -- Informatique Théorique et Applications 16, 303-316 (with A. Ehrenfeucht), 1982.

Repetitions in homomorphisms and languages, LNCS 140, 192-211, Springer Verlag (with A. Ehrenfeucht), July 1982.

Basic formulas and languages, Part II: Applications to E0L systems and forms, Discrete Applied Mathematics 4, 11-22 (with A. Ehrenfeucht, R. Verraedt), 1982.

Controlled graph transformations, in: Proceedings of the 8th Conference on graph theoretic concepts in computer science (H.J. Schneider, H. Göttler, eds.), Hanser Verlag, München-Wien, (with H. Ehrig, D. Janssens, H.-J. Kreowski), 1982.

Graph grammars with neighbourhood-controlled embedding, Theoretical Computer Science 21(1), 55-74 (with D. Janssens), October 1982.

On sequential and parallel noderewriting graph grammars, Computer Graphics and Image Processing 18, 279-304 (with D. Janssens, R. Verraedt), 1982.

Corrigendum: Sequential, continuous and parallel grammars, Information and Control 52(3), 364 (with H.C.M. Kleijn), March 1982.

On the role of blocking in rewriting systems, Acta Cybernetica 5, 389-408 (with H.C.M. Kleijn, R. Verraedt), 1982.

Using string languages to describe picture languages, Information and Control 54(3), 155-185 (with H.A. Maurer, E. Welzl), September 1982.

Completeness of E0L forms is decidable, Acta Informatica 17, 69-87 (with R. Verraedt), 1982.

Studies in uniformity, Information Sciences 26, 69-87 (with R. Verraedt), 1982.

A note on the similarity depth, Discrete Applied Mathematics 4, 237-241 (with R. Verraedt), 1982 1982.

Subset languages of Petri nets, in: Proceeedings of the third Workshop on applications and theory of Petri nets, 407-420 (with R. Verraedt), 1982.

Pumping lemmas for regular sets, SIAM Journal on Computing 10(3), 536-541 (with A. Ehrenfeucht, R. Parikh), August 1981.

On the subword complexity of square-free D0L languages, Theoretical Computer Science 16, 25-32 (with A. Ehrenfeucht), October 1981.

On the subword complexity of D0L languages with a constant distribution, Information Processing Letters 13, 108-113 (with A. Ehrenfeucht), December 1981.

FP0L systems generating counting languages, R.A.I.R.O. -- Informatique Théorique et Applications 15, 161-173 (with A. Ehrenfeucht), 1981.

On the (generalized) Post correspondence problem with lists of length 2., LNCS 115, 408-416, Springer Verlag (with A. Ehrenfeucht), July 1981.

On the subword complexity and square freeness of formal languages, LNCS 104, 1-4, Springer Verlag (with A. Ehrenfeucht), 1981.

A morphic representation of complements of recursively enumerable sets, Journal of the ACM 28(4), 706-714 (with A. Ehrenfeucht, K. Ruohonen), October 1981.

On ET0L systems with finite tree-rank, SIAM Journal on Computing 10(1), 40-58 (with A. Ehrenfeucht, D. Vermeir), February 1981.

Basic formulas and languages, Part I: The theory, Discrete Applied Mathematics 3, 235-255 (with A. Ehrenfeucht, R. Verraedt), 1981.

A translational theorem for the class of EOL languages, Information and Control 50, 175-183 (with J. Engelfriet), 1981.

Decision problems for node label controlled graph grammars, Journal of Computer and System Sciences 22(2), 144-177 (with D. Janssens), April 1981.

A characterization of context-free string languages by directed node-label controlled graph grammars, Acta Informatica 16, 63-85 (with D. Janssens), 1981.

Sequential, continuous and parallel grammars, Information and Control 48, 221-260 (with H.C.M. Kleijn), 1981.

Context-free like restrictions on selective rewriting, Theoretical Computer Science 16(3), 237-269 (with H.C.M. Kleijn), December 1981.

A general framework for comparing sequential and parallel rewriting, LNCS 118, 360-368, Springer Verlag (with H.C.M. Kleijn), 1981.

On the role of selectors in selective substitition grammars, LNCS 117, 190-198, Springer Verlag (with H.C.M. Kleijn), 1981.

On the constructive description of graph languages accepted by finite automata., LNCS 118, 398-409, Springer Verlag (with H.-J. Kreowski), 1981 1981.

Sub context-free L forms, International Journal of Computer Mathematics 9, 25-41 (with H.A. Maurer), 1981.

On subwords of formal languages, LNCS 117, 328-333, Springer Verlag , 1981.

Table systems with unconditional transfer, Discrete Applied Mathematics 3, 319-322 (with A. Salomaa), 1981.

A hierarchy of ET0L languages with rank, Fundamenta Informaticae IV, 197-205 (with D. Vermeir), 1981.

E0L forms and finite substitutions of 0L forms, International Journal of Computer Mathematics 10, 17-34 (with R. Verraedt), 1981.

On pure, terminal invariant and nonterminal invariant interpretations of E0L forms, Theoretical Computer Science 14(3), 267-288 (with R. Verraedt), June 1981.

On fixed, terminal fixed and nonterminal fixed interpretations of EOL forms, Information and Control 48(2), 119-146 (with R. Verraedt), February 1981.

Recursion and pumping in L forms, Information Sciences 25, 43-72 (with R. Verraedt), 1981.

Simple EOL forms under uniform interpretation generating CF languages, Fundamenta Informaticae 3, 141-156 (with J. Albert, H. Maurer, Th. Ottmann), 1980.

Continuous grammars, Information and Control 46, 71-91 (with A. Ehrenfeucht, H. Maurer), 1980.

Every two equivalent DOL systems have a regular envelope, Theoretical Computer Science 10, 45-52 (with A. Ehrenfeucht), 1980.

DOS systems and languages: a missing block in the systematic theory of contextfree languages, LNCS 85, 134-141, Springer Verlag (with A. Ehrenfeucht), 1980.

On ambiguity in EOL systems, Theoretical Computer Science 12, 127-134 (with A. Ehrenfeucht), 1980.

On the emptiness of the intersection of two DOS languages problem, Information Processing Letters 10, 223-225 (with A. Ehrenfeucht), 1980.

The sequence equivalence problem is decidable for OS systems, Journal of the ACM 27, 656-663 (with A. Ehrenfeucht), 1980.

On a bound for the DOL sequence equivalence problem, Theoretical Computer Science 12, 339-342 (with A. Ehrenfeucht), 1980.

On basic propertis of DOS systems and languages, Information and Control 47, 138-153 (with A. Ehrenfeucht), 1980.

Synchronized and desynchronized EOL forms, Discrete Applied Mathematics 2, 73-76 (with A. Ehrenfeucht, R. Verraedt), 1980.

Fixed point languages, equality languages and representation of recursively enumerable languages, Journal of the ACM 27, 499-518 (with J. Engelfriet), 1980.

Tree transducers, L systems and two-way machines, Journal of Computer and System Sciences 20, 150-202 (with J. Engelfriet, G. Slutzki), 1980.

On the structure of node-label controlled graph languages, Information Sciences 20, 191-216 (with D. Janssens), 1980.

Restrictions, extensions and variations of NLC grammars, Information Sciences 20, 217-244 (with D. Janssens), 1980.

A study in parallel rewriting systems, Information and Control 44, 134-163 (with H.C.M. Kleijn), 1980.

On metalinear ETOL systems, Fundamenta Informaticae 3, 15-36 (with D. Vermeir), 1980.

A note on the M-growth functions of FTOL systems with rank, Fundamenta Informaticae 3, 295-302 (with D. Vermeir), 1980.

Many-to-one simulation in EOL forms is decidable, Applied Mathematics 2, 233-247 (with R. Verraedt), 1980.

Synchronized and desynchronized EOL systems, Information and Control 46, (with R. Verraedt), 1980.

Synchronization and related phenomena in the theory of EOL systems and EOL forms, Bulletin de la Société Mathématique de Belgique 32, 189-208 (with R. Verraedt), 1980.

Context-free grammars with selective rewriting, Acta Informatica 13, 257-268 (with D. Wood), 1980.

On arithmic substitutions of EDTOL languages, Foundations of Control Engineering 4, (with A. Ehrenfeucht), 1979.

A result on the structure of ETOL languages, Foundations of Control Engineering 4, 165-171 (with A. Ehrenfeucht), 1979.

Finding a homomorphism between two words is NP complete, Information Processing Letters 9, 86-88 (with A. Ehrenfeucht), 1979.

An observation on scattered grammars, Information Processing Letters 9, 84-85 (with A. Ehrenfeucht), 1979.

On the structure of polynomially bounded DOL systems, Fundamenta Informaticae 2, 187-197 (with A. Ehrenfeucht), 1979.

On ETOL systems with rank, Journal of Computer and System Sciences 19, 237-255 (with A. Ehrenfeucht, D. Vermeir), 1979.

Equality languages and fixed point languages, Information and Control 43, 20-49 (with J. Engelfriet), 1979.

Parallel generation of maps: Developmental systems for cell layers, LNCS 73, 301-316, Springer Verlag (with A. Lindenmayer), 1979.

Pure interpretations of EOL forms, R.A.I.R.O. -- Informatique Théorique et Applications 13, 347-362 (with H. Maurer, A. Salomaa, D. Wood), 1979.

Parallelism and synchronization in two-level meta-controlled substitution grammars, Information and Control 18, 67-82 (with R. Meersman), 1979.

Persistent ETOL systems, Information Sciences 18, 189-212 (with R. Meersman, D. Vermeir), 1979.

Programs for instruction machines, Information and Control 41, 9-28 (with Z. Pawlak, W. Savitch), 1979.

A systematic approach to formal language theory through parallel rewriting, LNCS 71, 471-478, Springer Verlag , 1979.

On acceptors of iteration languages, International Journal of Computer Mathematics 7, 3-19 (with D. Vermeir), 1979.

Extending the notion of finite index, LNCS 71, 479-488, Springer Verlag (with D. Vermeir), 1979.

On recursion in ETOL systems, Journal of Computer and System Sciences 19, 179-196 (with D. Vermeir), 1979.

Simple EOL forms under uniform interpretation generating CF languages, LNCS 62, 1-14, Springer Verlag (with J. Albert, H. Maurer), 1978.

A note on DOL length sets, Discrete Mathematics 22, 233-242 (with A. Ehrenfeucht, J. Karhumäki), 1978.

Simplifications of homomorphisms, Information and Control 38, 298-309 (with A. Ehrenfeucht), 1978.

EOL languages are not codings of FPOL languages, Theoretical Computer Science 6, 327-342 (with A. Ehrenfeucht), 1978.

Elementary homomorphisms and a solution of the DOL equivalence problem, Theoretical Computer Science 7, 169-184 (with A. Ehrenfeucht), 1978.

On the relationship between context free programmed grammars and ETOL systems, Fundamenta Informaticae 1, 325-345 (with A. Ehrenfeucht), 1978.

Increasing the similarity of EOL form interpretations, Information and Control 38, 330-342 (with H. Maurer), 1978.

Two-level meta-controlled substitution grammars, Acta Informatica , 323-339 (with R. Meersman), 1978.

A note on generalized context-independent rewriting, Communication and Cognition 11, 181-196 (with R. Meersman), 1978.

On cooperating grammars, LNCS 64, 364-373, Springer Verlag (with R. Meersman), 1978.

Priorities on context conditions in rewriting systems, Information Sciences 14, 15-50 (with V. Solms), 1978.

On the effect of the finite index restriction on several families of grammars, Information and Control 39, 284-301 (with D. Vermeir), 1978.

On ETOL systems of finite index, Information and Control 38, 103-133 (with D. Vermeir), 1978.

On the effect of the finite index restriction on several families of grammars, Part II: Context-dependent systems, Foundations of Control Engineering 3, 125-142 (with D. Vermeir), 1978.

On some context-free languages that are not deterministic ETOL languages, R.A.I.R.O. -- Informatique Théorique et Applications 11, 273-292 (with A. Ehrenfeucht), 1977.

TIL systems and languages, Information Sciences 12, 203-277 (with K.P. Lee), 1977.

Two-level meta-controlled substitution grammars, LNCS 53, 390-397, Springer Verlag (with R. Meersman), 1977.

Bibliography of L systems, Theoretical Computer Science 5, 339-354 (with M. Penttonen, A. Salomaa), 1977.

A note on universal grammars, Information and Control 34, 172-175, 1977.

Selective substitution grammars, Part I: Definitions and examles, Journal of Information Processing and Cybernetics EIK 13, 455-463, 1977.

New squeezing mechanism for L systems, Information Sciences 2, 187-203 (with A. Salomaa), 1977.

L-systems of finite index, LNCS 52, 430-439, Springer Verlag (with D. Vermeir), 1977.

Acceptors for iteration languages, LNCS 53, 460-464, Springer Verlag (with D. Vermeir), 1977.

On the number of subwords of everywhere growing and uniform DTOL languages, Discrete Mathematics 15, 223-234 (with A. Ehrenfeucht, K.P. Lee), 1976.

On proving that certain languages are not ETOL, Acta Informatica 6, 407-415 (with A. Ehrenfeucht), 1976.

A relationship between ETOL and EDTOL languages, Theoretical Computer Science 1, 325-330 (with A. Ehrenfeucht, S. Skyum), 1976.

On slicing of K-iteration grammars, Information Processing Letters 4, 127-131, 1976.

More on ETOL systems versus random context grammars, Information Processing Letters 5, 102-106, 1976.

Context-free grammars with graph controlled tables, Journal of Computer and System Sciences 13, 90-99, 1976.

Developmental systems with fragmentation, International Journal of Computer Mathematics 5, 177-191 (with K. Ruohonen, A. Salomaa), 1976.

A note on family of acceptors for some families of developmental languages, International Journal of Computer Mathematics 5, 261-266 (with D. Wood), 1976.

A note on K-iteration grammars, Information Processing Letters 4, 162-168 (with D. Wood), 1976.

Subword complexities of various classes of deterministic developmental languages with interactions, International Journal of Computer Mathematics 4, 219-236 (with A. Ehrenfeucht, K.P. Lee), 1975.

Subword complexities of various deterministic developmental languages without interactions, Theoretical Computer Science 1, 59-76 (with A. Ehrenfeucht, K.P. Lee), 1975.

A pumping theorem for deterministic EOL languages, R.A.I.R.O. -- Informatique Théorique et Applications 9, 13-23 (with A. Ehrenfeucht), 1975.

Description of developmental languages, using recurrence systems, Mathematical Systems Theory 8, 316-341 (with G.T. Herman, A. Lindenmayer), 1975.

Some properties of the class of L-languages with interactions, Journal of Computer and System Sciences 11, 129-147 (with K.P. Lee), 1975.

TOL schemes and control sets, Information and Control 27, 109-125, 1975.

L systems, sequences and languages, LNCS 34, 71-84, Springer Verlag , 1975.

Generatively deterministic L languages, Subword point of view, LNCS 15, 93-103, Springer Verlag (with A. Ehrenfeucht), 1974.

DOL systems with rank, LNCS 15, 136-141, Springer Verlag (with A. Ehrenfeucht), 1974.

Three useful results concerning L languages without interaction, LNCS 15, 72-77, Springer Verlag (with A. Ehrenfeucht), 1974.

The equality of EOL languages and codings of OL languages, International Journal of Computer Mathematics 4, 85-104 (with A. Ehrenfeucht), 1974.

The number of occurrences of letters versus their distribution in some EOL languages, Information and Control 26, 256-271 (with A. Ehrenfeucht), 1974.

Nonterminals versus homomorphisms in defining languages from some classes of rewriting systems, Acta Informatica 4, 87-106 (with A. Ehrenfeucht), 1974.

Developmental systems with finite axiom sets, Part I: Systems without interactions, International Journal of Computer Mathematics 4, 43-68 (with K.P. Lee), 1974.

Developmental systems with finite axiom sets, Part II: Systems with interaction, International Journal of Computer Mathematics 4, 281-304 (with K.P. Lee), 1974.

The length of DOL languages are uniformly bounded, Information Processing Letters 2, 185-188 (with K.P. Lee), 1974.

Bibliography on L systems, LNCS 15, 327-338, Springer Verlag (with K.P. Lee), 1974.

Nonterminals, homomorphisms and codings in different variations of OL systems, part II: Nondeterministic systems, Acta Informatica 3, 357-364 (with M. Nielsen, A. Salomaa, S. Skyum), 1974.

DOL sequences, Discrete Mathematics 7, 323-347, 1974.

Circularities in DOL sequences, Revue Roumaine de Mathématiques Pures et Appliquées 9, 1131-1152, 1974.

Trade-off between the use of nonterminals, codings and homomorphisms in defining languages for some classes of rewriting systems, LNCS 14, 473-580, Springer Verlag , 1974.

Theory of L systems from the point of view of formal language theory, LNCS 14, 1-23, Springer Verlag , 1974.

Generative models for parallel processes, Computer Journal 17, 344-348 (with D. Wood), 1974.

A limit theorem for sets of subwords in deterministic TOL languages, Information Processing Letters 2, 70-73 (with A. Ehrenfeucht), 1973.

Developmental systems with locally catenative formulas, Acta Informatica 2, 214-248 (with A. Lindenmayer), 1973.

TOL systems and languages, Information and Control 23, 357-381, 1973.

Extension of tabled OL systems and languages, International Journal of Computer and Information Sciences 2, 311-333, 1973.

Characterization of unary developmental languages, Discrete Mathematics 6, 235-247 (with G.T. Herman, K.P. Lee, J. van Leeuwen), 1972.

Constant-program address machines are universal, Revue Roumaine de Mathématiques Pures et Appliquées 17, 417-424, 1972.

The equivalence problem for deterministic TOL systems is undecidable, Information Processing Letters 1, 201-204, 1972.

Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for 0L systems, Information Processing Letters 1, 233-235, 1972.

Direction controlled programmed grammars, Acta Informatica 1, 242-252, 1972.

Direction controlled context-free programmed grammars, Acta Informatica 2, 214-248, 1972.

The unsolvability of the isomorphism problem for address machines, Revue Roumaine de Mathématiques Pures et Appliquées 16, 1553-1558, 1971.

On OL Languages, Information and Control 19, 302-318 (with P. Doucet), 1971.

On the introduction of orderings into the grammars of Chomsky's hierarchy, Bulletin de l'Académie Polonaise des Sciences 17, 559-563, 1969.

Finite memory address machines are universal, Bulletin de l'Académie Polonaise des Sciences 17, 401-403, 1969.

P-automata and P-events, Bulletin de l'Académie Polonaise des Sciences 17, 565-570, 1969.

Some remarks on Rabin and Scott's notion of multi-tape automaton, Bulletin de l'Académie Polonaise des Sciences 16, 215-218, 1968.

Axioms for the category of relations with composition, Bulletin de l'Académie Polonaise des Sciences 15, 5-9, 1967.

About some properties of quasi-uniform chain automata with r > 0, Bulletin de l'Académie Polonaise des Sciences 15, 543-546, 1967.

Decision problems for quasi-uniform events, Bulletin de l'Académie Polonaise des Sciences 15, 745-652, 1967.

Languages of derivations, Bulletin de l'Académie Polonaise des Sciences 15, 753-758, 1967.