Grzegorz Rozenberg

According to our database1, Grzegorz Rozenberg
  • authored at least 479 papers between 1971 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Applying regions.
Theor. Comput. Sci., 2017

Evolving reaction systems.
Theor. Comput. Sci., 2017

2016
Preface.
Fundam. Inform., 2016

Hartmut Ehrig (1944-2016).
Bulletin of the EATCS, 2016

2015
Standard and ordered zoom structures.
Theor. Comput. Sci., 2015

TCS in the 21st century.
Theor. Comput. Sci., 2015

Model checking temporal properties of reaction systems.
Inf. Sci., 2015

2014
Preface.
Theor. Comput. Sci., 2014

Zoom Structures and reaction Systems Yield Exploration Systems.
Int. J. Found. Comput. Sci., 2014

Enjoying to Work.
Fundam. Inform., 2014

Preface.
Fundam. Inform., 2014

Wilfried Brauer (1937-2014) in memoriam.
Bulletin of the EATCS, 2014

2013
Professor Zdzisław Pawlak (1926-2006): Founder of the Polish School of Artificial Intelligence.
Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

In Memoriam: Carl Adam Petri.
Trans. Petri Nets and Other Models of Concurrency, 2013

Preface.
Theor. Comput. Sci., 2013

Preface.
Theor. Comput. Sci., 2013

Research Frontiers of membrane Computing: Open Problems and Research Topics.
Int. J. Found. Comput. Sci., 2013

Bridging Membrane and Reaction Systems - Further Results and Research Topics.
Fundam. Inform., 2013

Preface.
Fundam. Inform., 2013

Step semantics of boolean nets.
Acta Inf., 2013

Processes Inspired by the Functioning of Living Cells: Natural Computing Approach - (Abstract).
Proceedings of the Unconventional Computation and Natural Computation, 2013

Processes Inspired by the Functioning of Living Cells: Natural Computing Approach.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Computational Nature of Gene Assembly in Ciliates.
Proceedings of the Handbook of Natural Computing, 2012

Minimal Reaction Systems.
Trans. Computational Systems Biology, 2012

Preface.
Theor. Comput. Sci., 2012

Preface.
Theor. Comput. Sci., 2012

Preface.
Theor. Comput. Sci., 2012

Preface.
Theor. Comput. Sci., 2012

Preface.
Theor. Comput. Sci., 2012

Preface.
Theor. Comput. Sci., 2012

Preface.
Theor. Comput. Sci., 2012

Preface.
Theor. Comput. Sci., 2012

Stability and Chaos in reaction Systems.
Int. J. Found. Comput. Sci., 2012

Preface.
Fundam. Inform., 2012

Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju.
Fundam. Inform., 2012

Membrane Systems and Petri Net Synthesis
Proceedings of the Proceedings 6th Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2012

A Formal Framework for Processes Inspired by the Functioning of Living Cells.
Proceedings of the Implementation and Application of Automata, 2012

Relevance of Entities in Reaction Systems.
Proceedings of the Languages Alive, 2012

Representing Reaction Systems by Trees.
Proceedings of the Computation, Physics and Beyond, 2012

2011
Preface.
Theor. Comput. Sci., 2011

Preface.
Theor. Comput. Sci., 2011

Preface.
Theor. Comput. Sci., 2011

Preface.
Theor. Comput. Sci., 2011

Preface.
Theor. Comput. Sci., 2011

Preface.
Theor. Comput. Sci., 2011

Preface.
Theor. Comput. Sci., 2011

Preface.
Theor. Comput. Sci., 2011

On aggregation in multiset-based self-assembly of graphs.
Natural Computing, 2011

Functions Defined by Reaction Systems.
Int. J. Found. Comput. Sci., 2011

A Tour of reaction Systems.
Int. J. Found. Comput. Sci., 2011

Preface.
Fundam. Inform., 2011

Petri Nets for Biologically Motivated Computing.
Sci. Ann. Comp. Sci., 2011

Petri Nets and Bio-Modelling - and how to benefit from their synergy
CoRR, 2011

A Formal Framework for Bioprocesses in Living Cells.
Proceedings of the Unconventional Computation - 10th International Conference, 2011

Reaction Systems with Duration.
Proceedings of the Computation, 2011

Classifying Boolean Nets for Region-based Synthesis.
Proceedings of the Workshop Applications of Region Theory 2011, 2011

2010
Preface.
Theor. Comput. Sci., 2010

Preface.
Theor. Comput. Sci., 2010

Preface.
Theor. Comput. Sci., 2010

Preface.
Theor. Comput. Sci., 2010

Gene assembly in Ciliates.
Scholarpedia, 2010

Preface.
Natural Computing, 2010

Combinatorics of Life and Death for Reaction Systems.
Int. J. Found. Comput. Sci., 2010

Reaction Systems: a Formal Framework for Processes Based on Biochemical Interactions.
ECEASST, 2010

A Note on Causalities in Reaction Systems.
ECEASST, 2010

Reaction Systems: A Model of Computation Inspired by Biochemistry.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Preface.
Theor. Comput. Sci., 2009

Preface.
Theor. Comput. Sci., 2009

Preface.
Theor. Comput. Sci., 2009

Preface.
Theor. Comput. Sci., 2009

Preface.
Theor. Comput. Sci., 2009

Preface.
Theor. Comput. Sci., 2009

Introducing time in reaction systems.
Theor. Comput. Sci., 2009

Reduction Graphs from Overlap Graphs for Gene Assembly in Ciliates.
Int. J. Found. Comput. Sci., 2009

Computational Nature of Processes Induced by Biochemical Reactions.
Proceedings of the Membrane Computing, 10th International Workshop, 2009

Reaction Systems: A Formal Framework for Processes.
Proceedings of the Applications and Theory of Petri Nets, 2009

2008
Preface.
Theor. Comput. Sci., 2008

Preface.
Theor. Comput. Sci., 2008

Preface.
Theor. Comput. Sci., 2008

Preface.
Theor. Comput. Sci., 2008

Membrane systems with proteins embedded in membranes.
Theor. Comput. Sci., 2008

Patterns of simple gene assembly in ciliates.
Discrete Applied Mathematics, 2008

The many facets of natural computing.
Commun. ACM, 2008

Summary of the Workshop on Natural Computing and Graph Transformations.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Graph Transformation Units - An Overview.
Proceedings of the Concurrency, 2008

Modeling Interactions between Biochemical Reactions.
Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008

2007
Preface.
Theor. Comput. Sci., 2007

Preface.
Theor. Comput. Sci., 2007

Cycles and communicating classes in membrane systems and molecular dynamics.
Theor. Comput. Sci., 2007

Events and modules in reaction systems.
Theor. Comput. Sci., 2007

Computing Morphisms by Spiking Neural P Systems.
Int. J. Found. Comput. Sci., 2007

In Memory of Professor Zdzislaw Pawlak.
Fundam. Inform., 2007

Reaction Systems.
Fundam. Inform., 2007

Multiset-Based Self-Assembly of Graphs.
Fundam. Inform., 2007

Membrane Systems with Marked Membranes.
Electr. Notes Theor. Comput. Sci., 2007

Finite metrics in switching classes.
Discrete Applied Mathematics, 2007

How Overlap Determines the Macronuclear Genes in Ciliates
CoRR, 2007

DNA computing of solutions to knapsack problems.
Biosystems, 2007

From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation.
Proceedings of the Computation and Logic in the Real World, 2007

Biochemical Reactions as Computations.
Proceedings of the Computation and Logic in the Real World, 2007

Contextual Array Grammars.
Proceedings of the Formal Models, 2007

2006
Preface.
Theor. Comput. Sci., 2006

Preface.
Theor. Comput. Sci., 2006

Reducibility of gene patterns in ciliates using the breakpoint graph.
Theor. Comput. Sci., 2006

The Construction of Minimal DNA Expressions.
Natural Computing, 2006

Application of Mismatch Detection Methods in DNA Computing.
Natural Computing, 2006

Parallelism in Gene Assembly.
Natural Computing, 2006

Process Semantics for Membrane Systems.
Journal of Automata, Languages and Combinatorics, 2006

Communication Membrane Systems with Active Symports.
Journal of Automata, Languages and Combinatorics, 2006

Spike Trains in Spiking Neural P Systems.
Int. J. Found. Comput. Sci., 2006

Covers from Templates.
Int. J. Found. Comput. Sci., 2006

The Embedding Problem for Switching Classes of Graphs.
Fundam. Inform., 2006

Interpreted Trajectories.
Fundam. Inform., 2006

Foreword.
ECEASST, 2006

Zdzislaw Pawlak (1926-2006).
Bulletin of the EATCS, 2006

Reducibility of Gene Patterns in Ciliates using the Breakpoint Graph
CoRR, 2006

Embedding linear orders in grids.
Acta Inf., 2006

Theory Inspired by Gene Assembly in Ciliates.
Proceedings of the Implementation and Application of Automata, 2006

Modelling Simple Operations for Gene Assembly.
Proceedings of the Nanotechnology: Science and Computation, 2006

Membrane Systems with External Control.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

Formalizing Spherical Membrane Structures and Membrane Proteins Populations.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

Complexity Measures for Gene Assembly.
Proceedings of the Knowledge Discovery and Emergent Complexity in Bioinformatics, 2006

Workshop on Petri Nets and Graph Transformations.
Proceedings of the Graph Transformations, Third International Conference, 2006

Computational Nature of Biochemical Reactions.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
Preface.
Theor. Comput. Sci., 2005

Preface.
Theor. Comput. Sci., 2005

Preface: Insightful Theory.
Theor. Comput. Sci., 2005

Protein output for DNA computing.
Natural Computing, 2005

Preface.
Natural Computing, 2005

Contagious Creativity.
Fundam. Inform., 2005

Preface.
Electr. Notes Theor. Comput. Sci., 2005

Towards a Petri Net Semantics for Membrane Systems.
Proceedings of the Membrane Computing, 6th International Workshop, 2005

Simple Operations for Gene Assembly.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

The Breakpoint Graph in Ciliates.
Proceedings of the Computational Life Sciences, First International Symposium, 2005

Main Concepts of Networks of Transformation Units with Interlinking Semantics.
Proceedings of the Formal Methods in Software and Systems Modeling, 2005

2004
Preface.
Theor. Comput. Sci., 2004

Gene Assembly in Celiates. Part I. Molecular Operations (Column: Natural Computing).
Bulletin of the EATCS, 2004

Transitivity of local complementation and switching on graphs.
Discrete Mathematics, 2004

Tutorial on DNA Computing and Graph Transformation.
Proceedings of the Graph Transformations, Second International Conference, 2004

Workshop on Petri Nets and Graph Transformations.
Proceedings of the Graph Transformations, Second International Conference, 2004

Embedding in Switching Classes with Skew Gains.
Proceedings of the Graph Transformations, Second International Conference, 2004

Combinatorial Aspects of Minimal DNA Expressions.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Application of Mismatch Detection Methods in DNA Computing.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Parallelism in Gene Assembly.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Basic Notions of Reaction Systems.
Proceedings of the Developments in Language Theory, 2004

Two Models for Gene Assembly in Ciliates.
Proceedings of the Theory Is Forever, 2004

Formal Properties of Gene Assembly: Equivalence Problem for Overlap Graphs.
Proceedings of the Aspects of Molecular Computing, 2004

2003
DNA computing by blocking.
Theor. Comput. Sci., 2003

Forbidding-enforcing systems.
Theor. Comput. Sci., 2003

Formal systems for gene assembly in ciliates.
Theor. Comput. Sci., 2003

Gene Assembly in Ciliates Part I. Molecular Operations.
Bulletin of the EATCS, 2003

Synchronizations in Team Automata for Groupware Systems.
Computer Supported Cooperative Work, 2003

Gheorghe Paun and the Windmill Curiosity.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002
ICALP, EATCS and Maurice Nivat.
Theor. Comput. Sci., 2002

Preface.
Theor. Comput. Sci., 2002

A guide to membrane computing.
Theor. Comput. Sci., 2002

Membrane systems with carriers.
Theor. Comput. Sci., 2002

Gene assembly through cyclic graph decomposition.
Theor. Comput. Sci., 2002

Topics in the theory of DNA computing.
Theor. Comput. Sci., 2002

Models of Molecular Computing Based on Molecular Reactions.
New Generation Comput., 2002

How ciliates manipulate their own DNA - A splendid example of natural computing.
Natural Computing, 2002

Characterizing the Micronuclear Gene Patterns in Ciliates.
Theory Comput. Syst., 2002

String and Graph Reduction Systems for Gene Assembly in Ciliates.
Mathematical Structures in Computer Science, 2002

Computing by Communication in Networks of Membranes.
Int. J. Found. Comput. Sci., 2002

ReMembrane Systems with Coupled Transport: Universality and Normal Forms.
Fundam. Inform., 2002

Membrane systems with promoters/inhibitors.
Acta Inf., 2002

Tutorial on DNA Computing and Graph Transformation - Computational Nature of Gene Assembly in Ciliates.
Proceedings of the Graph Transformation, First International Conference, 2002

Computational Processes in Living Cells: Gene Assembly in Ciliates.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001
Formal properties of PA-matching.
Theor. Comput. Sci., 2001

Sequences of languages in forbidding-enforcing families.
Soft Comput., 2001

Hairpin Languages.
Int. J. Found. Comput. Sci., 2001

Nonconventional computing paradigms in the new millennium: a roundtable.
Computing in Science and Engineering, 2001

DNA-based computation.
Computing in Science and Engineering, 2001

Team automata for spatial access control.
Proceedings of the Seventh European Conference on Computer Supported Cooperative Work, 2001

Patterns of Micronuclear Genes in ciliates.
Proceedings of the DNA Computing, 7th International Workshop on DNA-Based Computers, 2001

Universal and simple operations for gene assembly in ciliates.
Proceedings of the Where Mathematics, 2001

Circularity and Other Invariants of Gene Assembly in Ciliates.
Proceedings of the Words, Semigroups, and Transductions, 2001

Behavior and Realization Construction for Petri Nets Based on Free Monoid and Power Set Graphs.
Proceedings of the Unifying Petri Nets, Advances in Petri Nets, 2001

2000
A characterization of poly-slender context-free languages.
ITA, 2000

Pancyclicity in switching classes.
Inf. Process. Lett., 2000

Membrane Computing with External Output.
Fundam. Inform., 2000

On strongly context-free languages.
Discrete Applied Mathematics, 2000

DNA Processing in Ciliates - the Wonders of DNA Computing in vivo.
Proceedings of the Unconventional Models of Computation, 2000

DNA Processing in Ciliates - A Computational Point of View (invited abstract).
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Gene Assembly in Ciliates: Computing by Folding.
Proceedings of the A Half-Century of Automata Theory: Celebration and Inspiration, 2000

String Tile Models for DNA Computing by Self-Assembly.
Proceedings of the DNA Computing, 6th International Workshop on DNA-Based Computers, 2000

1999
Some Properties of Duplication Grammars.
Acta Cybern., 1999

DNA Computing: New Ideas and Paradigms.
Proceedings of the Automata, 1999

Forbidding and enforcing.
Proceedings of the DNA Based Computers, 1999

The Theory of 2-Structures - A Framework for Decomposition and Transformation of Graphs.
World Scientific, ISBN: 978-981-02-4042-4, 1999

1998
Sticker Systems.
Theor. Comput. Sci., 1998

Shuffle on Trajectories: Syntactic Constraints.
Theor. Comput. Sci., 1998

On Representing Recursively Enumerable Languages by Internal Contextual Languages.
Theor. Comput. Sci., 1998

Permutations, parenthesis words, and Schröder numbers.
Discrete Mathematics, 1998

Simple Splicing Systems.
Discrete Applied Mathematics, 1998

Complementarity versus universality: Keynotes of DNA computing.
Complexity, 1998

DNA Computing, Sticker Systems, and Universality.
Acta Inf., 1998

Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information.
Proceedings of the Theory and Application of Graph Transformations, 1998

Complexity Issues in Switching of Graphs.
Proceedings of the Theory and Application of Graph Transformations, 1998

DNA Computing - New Computing Paradigms.
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-03563-4, 1998

1997
Invariants of Inversive 2-Structures on Groups of Labels.
Mathematical Structures in Computer Science, 1997

Geometric Transformations on Language Families: The Power of Symmetry.
Int. J. Found. Comput. Sci., 1997

Semantics of Nonsequential Tree-Based Computation Schemes.
Fundam. Inform., 1997

Node Replacement Graph Grammars.
Proceedings of the Handbook of Graph Grammars and Computing by Graph Transformations, 1997

2-Structures - A Framework For Decomposition And Transformation Of Graphs.
Proceedings of the Handbook of Graph Grammars and Computing by Graph Transformations, 1997

Watson-Crick finite automata.
Proceedings of the DNA Based Computers, 1997

Syntactic and Semantic Aspects of Parallelism.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

Shuffle-like Operations on omega-words.
Proceedings of the New Trends in Formal Languages, 1997

1996
Computing by Splicing.
Theor. Comput. Sci., 1996

Pattern Systems.
Theor. Comput. Sci., 1996

Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures.
Theor. Comput. Sci., 1996

A Note on Binary Grammatical Codes of Trees.
Theor. Comput. Sci., 1996

Finite Languages for the Representation of Finite Graphs.
J. Comput. Syst. Sci., 1996

Pattern Grammars.
Journal of Automata, Languages and Combinatorics, 1996

Contextual Grammars: Parallelism and Blocking of Derivation.
Fundam. Inform., 1996

On Representing RE Languages by One-Sided Internal Contextual Languages.
Acta Cybern., 1996

The Linear Landscape of External Contextual Languages.
Acta Inf., 1996

Forbidding, Enforcing.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

Elementary Net Systems.
Proceedings of the Lectures on Petri Nets I: Basic Models, 1996

Informal Introduction to Petri Nets.
Proceedings of the Lectures on Petri Nets I: Basic Models, 1996

1995
Transition Systems, Event Structures and Unfoldings
Inf. Comput., May, 1995

Grammars Based on the Shuffle Operation.
J. UCS, 1995

Parikh Prime Words and GO-like Territories.
J. UCS, 1995

Grammatical Codes of Trees and Terminally Coded Grammars.
Fundam. Inform., 1995

Generalised DOL Trees.
Acta Cybern., 1995

Theory of 2-Structures.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Dynamic change within workflow systems.
Proceedings of the Conference on Organizational Computing Systems, 1995

1994
Combinatorial Properties of Dependence Graphs
Inf. Comput., November, 1994

Properties of Grammatical Codes of Trees.
Theor. Comput. Sci., 1994

Clans and Regions in 2-Structures.
Theor. Comput. Sci., 1994

Hyperedge Channels are Abelian.
Theor. Comput. Sci., 1994

Semantics of Trees.
Mathematical Systems Theory, 1994

Dynamic Labeled 2-Structures.
Mathematical Structures in Computer Science, 1994

Reductions for Primitive 2-Structures.
Fundam. Inform., 1994

Square Systems.
Fundam. Inform., 1994

Incremental construction of 2-structures.
Discrete Mathematics, 1994

Structuring Grammar Systems by Priorities and Hierarchies.
Acta Cybern., 1994

Prescribed Teams of Grammars.
Acta Inf., 1994

Context-free Text Grammars.
Acta Inf., 1994

Group Based Graph Transformations and Hierarchical Representations of Graphs.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

Decompostion of Infinite Labeled 2-Structures.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

Dynamic Labeled 2-Structures with Variable Domains.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

Cornerstones of undecidability.
Prentice Hall International Series in Computer Science, Prentice Hall, ISBN: 978-0-13-297425-7, 1994

1993
T-structures, T-functions, and texts.
Theor. Comput. Sci., 1993

Computation Graphs for Actor Grammars.
J. Comput. Syst. Sci., 1993

Handle-Rewriting Hypergraph Grammars.
J. Comput. Syst. Sci., 1993

Combinatorial Properties of Texts.
ITA, 1993

On the Structure of Recognizable Languages of Dependence Graphs.
ITA, 1993

An Introduction to Dynamic Labled 2-Structures.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Contextual Grammars: Erasing, Determinism, One-Side Contexts.
Proceedings of the Developments in Language Theory, 1993

An Introduction to Context-free Text Grammars.
Proceedings of the Developments in Language Theory, 1993

1992
Elementary Transition Systems.
Theor. Comput. Sci., 1992

Angular 2-Structures.
Theor. Comput. Sci., 1992

Elementary Transition Systems and Refinement.
Acta Inf., 1992

A survey of equivalence notions for net based systems.
Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

1991
Nonterminal Separation in Graph Grammars.
Theor. Comput. Sci., 1991

Vector controlled concurrent systems, part II: comparisons.
Fundam. Inform., 1991

Diamond properties of elementary net systems.
Fundam. Inform., 1991

Grammatical codes of trees.
Discrete Applied Mathematics, 1991

Labeled 2-Structures.
Proceedings of the New Results and New Trends in Computer Science, 1991

1990
A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars
Inf. Comput., February, 1990

Primitivity is Hereditary for 2-Structures.
Theor. Comput. Sci., 1990

Theory of 2-Structures, Part II: Representation Through Labeled Tree Families.
Theor. Comput. Sci., 1990

Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms.
Theor. Comput. Sci., 1990

Edge-Label Controlled Graph Grammars.
J. Comput. Syst. Sci., 1990

The Complexity of Regular DNLC Graph Languages.
J. Comput. Syst. Sci., 1990

On structured graph grammars. II.
Inf. Sci., 1990

On structured graph grammars. I.
Inf. Sci., 1990

Behavioural Notions for Elementary Net Systems.
Distributed Computing, 1990

A Characterization of Set Representable Labeled Partial 2-Structures Through Decompositions.
Acta Inf., 1990

Partial (Set) 2-Structures. Part II: State Spaces of Concurrent Systems.
Acta Inf., 1990

Partial (Set) 2-Structures. Part I: Basic Notions and the Representation Problem.
Acta Inf., 1990

Graph Grammar-Based Description of Object-Based Systems.
Proceedings of the Foundations of Object-Oriented Languages, 1990

Net-Based Description Of Parallel Object-Based Systems, or POTs and POPs.
Proceedings of the Foundations of Object-Oriented Languages, 1990

Structured Transformations and Computation Graphs for Actor Grammars.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

Context-free Handle-rewriting Hypergraph Grammars.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

1989
Clans and the Complexity of Dependence graphs.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

Actor Grammars.
Mathematical Systems Theory, 1989

1988
Theory of Traces.
Theor. Comput. Sci., 1988

Apex Graph Grammars and Attribute Grammars.
Acta Inf., 1988

Recording the Use of Memory in Right-Boundary Grammars and Push-Down Automata.
Acta Inf., 1988

1987
Handle NLC Grammars and R.E. Languages.
J. Comput. Syst. Sci., 1987

Combinatorial properties of boundary NLC graph languages.
Discrete Applied Mathematics, 1987

1986
On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata.
Theor. Comput. Sci., 1986

The Bounded Degree Problem for NLC Grammars is Decidable.
J. Comput. Syst. Sci., 1986

Each Regular Code Is Included in A Maximal Regular Code.
ITA, 1986

Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma.
ITA, 1986

Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping.
ITA, 1986

Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity
Information and Control, 1986

On the membership problem for regular DNLC grammars.
Discrete Applied Mathematics, 1986

Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages.
Acta Inf., 1986

An introduction to the NLC way of rewriting graphs.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

Fundamentals of edge-label controlled graph grammars.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

Basic notions of actor grammars: A graph grammar model for actor computation.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

Apex Graph Grammars.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

Restricting the complexity of regular DNLC languages.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

Behaviour of Elementary Net Systems.
Proceedings of the Petri Nets: Central Models and Their Properties, 1986

Petri Nets: Basic Notions, Structure, Behaviour.
Proceedings of the Current Trends in Concurrency, Overviews and Tutorials, 1986

Infinitary Languages: Basic Theory an Applications to Concurrent Systems.
Proceedings of the Current Trends in Concurrency, Overviews and Tutorials, 1986

The book of L.
Springer, ISBN: 978-3-540-16022-9, 1986

1985
On Coordinated Selective Substitutions: Towards a Unified Theory of Grammars and Machines.
Theor. Comput. Sci., 1985

Adding Global Forbidding Context to Context-Free Grammars.
Theor. Comput. Sci., 1985

CTS Systems and Petri Nets.
Theor. Comput. Sci., 1985

A Combinatorial Property of EOL Languages.
Mathematical Systems Theory, 1985

Strong Iterative Pairs and The Regularity of Context-Free Languages.
ITA, 1985

On erasing in EOL forms.
Discrete Applied Mathematics, 1985

A morphic representation of EOL languages and other ETOL languages.
Discrete Applied Mathematics, 1985

Traces, dependency graphs and DNLC grammars.
Discrete Applied Mathematics, 1985

On coordinated rewriting.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
An Easy Proof of Greibach Normal Form
Information and Control, December, 1984

On Simulation and Propagating E0L Forms.
Theor. Comput. Sci., 1984

On Inherently Ambiguous E0L Languages.
Theor. Comput. Sci., 1984

Restrictions on NLC Graph Grammars.
Theor. Comput. Sci., 1984

Commutative One-Counter Languages are Regular.
J. Comput. Syst. Sci., 1984

On Ambiguity in Dos Systems.
ITA, 1984

Note on Node-Rewriting Graph Grammars.
Inf. Process. Lett., 1984

Direction Independent Context-Sensitive Grammars
Information and Control, 1984

Generalized Handle Grammars and Their Relation to Petri Nets.
Elektronische Informationsverarbeitung und Kybernetik, 1984

On regularity of languages generated by copying systems.
Discrete Applied Mathematics, 1984

Boundary NLC Grammars.
Proceedings of the CAAP'84, 1984

1983
Subset Languages of Petri Nets Part II: Closure Properties.
Theor. Comput. Sci., 1983

Subset Languages of Petri Nets Part I: The Relationship to String Languages and Normal Forms.
Theor. Comput. Sci., 1983

On Regularity of Context-Free Languages.
Theor. Comput. Sci., 1983

Context Free Normal Systems and ETOL Systems.
J. Comput. Syst. Sci., 1983

Hypergraph Systems and Their Extensions.
ITA, 1983

On the Separating Power of Eol Systems.
ITA, 1983

On the Subword Complexity of m-Free D0L Languages.
Inf. Process. Lett., 1983

On the Subword Complexity of Locally Catenative D0L Languages.
Inf. Process. Lett., 1983

Repetition of Subwords in DOL Languages
Information and Control, 1983

The goodness of {S, a}-EOL forms is decidable.
Discrete Applied Mathematics, 1983

On sequential and parallel node-rewriting graph grammars, II.
Computer Vision, Graphics, and Image Processing, 1983

Grammatical constructions in selective substitution grammars.
Acta Cybern., 1983

On the Generative Power of Regular Pattern Grammars.
Acta Inf., 1983

A Survey of NLC Grammars.
Proceedings of the CAAP'83, 1983

1982
Using String Languages to Describe Picture Languages
Information and Control, September, 1982

Corrigendum: Sequential, Continuous and Parallel Grammars
Information and Control, March, 1982

Graph Grammars with Neighbourhood-Controlled Embedding.
Theor. Comput. Sci., 1982

Representation Theorems Using DOS Languages.
Theor. Comput. Sci., 1982

The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable.
Theor. Comput. Sci., 1982

On Subword Complexities of Homomorphic Images of Languages.
ITA, 1982

Studies in uniformity.
Inf. Sci., 1982

A note on the similarity depth.
Discrete Applied Mathematics, 1982

Basic formulas and languages: PART II.Applications to E0L systems and forms.
Discrete Applied Mathematics, 1982

Cell division patterns: Syntactical description and implementation.
Computer Graphics and Image Processing, 1982

On sequential and parallel node-rewriting graph grammars.
Computer Graphics and Image Processing, 1982

On the role of blocking in rewriting systems.
Acta Cybern., 1982

Completeness of E 0 L Forms is Decidable.
Acta Inf., 1982

Repetitions in Homomorphisms and Languages.
Proceedings of the Automata, 1982

Conditions Enforcing Regularity of Context-Free Languages.
Proceedings of the Automata, 1982

Chain code picture languages.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982

Graph grammars with node-label controlled rewriting and embedding.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982

Hypergraph systems generating graph languages.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982

Petri nets and their relation to graph grammars.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982

Subset Languages of Petri Nets.
Proceedings of the Applications and Theory of Petri Nets, 1982

1981
A Tranlsational Theorem for the Class of EOL Languages
Information and Control, August, 1981

Sequential, Continuous and Parallel Grammars
Information and Control, March, 1981

On Fixed, Terminal Fixed and Nonterminal Fixed Interpretations of EOL Forms
Information and Control, February, 1981

On Pure, Terminal Invariant and Nonterminal Invariant Interpretations of E0L Forms.
Theor. Comput. Sci., 1981

Context-Free Like Restrictions on Selective Rewriting.
Theor. Comput. Sci., 1981

On the Subword Complexity of Square-Free D0L Languages.
Theor. Comput. Sci., 1981

On ET0L Systems with Finite Tree-Rank.
SIAM J. Comput., 1981

Pumping Lemmas for Regular Sets.
SIAM J. Comput., 1981

Decision Problems for Node Label Controlled Graph Grammars.
J. Comput. Syst. Sci., 1981

A Morphic Representation of Complements of Recursively Enumerable Sets.
J. ACM, 1981

FPOL Systems Generating Counting Languages.
ITA, 1981

Recursion and pumping in L Forms.
Inf. Sci., 1981

On the Subword Complexity of D0L Languages with a Constant Distribution.
Inf. Process. Lett., 1981

A hierarchy of ETOL languages with rank.
Fundam. Inform., 1981

Table systems with unconditional transfer.
Discrete Applied Mathematics, 1981

Basic formulas and languages Part I. The theory.
Discrete Applied Mathematics, 1981

A Characterization of Context-free String Languages by Directed Node-label Controlled Graph Grammars.
Acta Inf., 1981

On the Subword Complexity and Square-Freeness of Formal Languages.
Proceedings of the Theoretical Computer Science, 1981

On the Constructive Description of Graph Languages Accepted by Finite Automata.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

A General Framework for Comparing Sequential and Parallel Rewriting.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

On the (Generalized) Post Correspondence Problem with Lists of Length 2.
Proceedings of the Automata, 1981

On Subwords of Formal Languages.
Proceedings of the Fundamentals of Computation Theory, 1981

On the Role of Selectors in Selective Substitution Grammars.
Proceedings of the Fundamentals of Computation Theory, 1981

Generating Graph Languages Using Hypergraph Grammars.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
On Basic Properties of DOS Systems and Languages
Information and Control, November, 1980

Synchronized, Desynchronized and Coordinated EOL Systems
Information and Control, August, 1980

Continuous Grammars
Information and Control, July, 1980

A Study in Parallel Rewriting Systems
Information and Control, February, 1980

On a Bound for the D0L Sequence Equivalence Problem.
Theor. Comput. Sci., 1980

On Ambiguity in E0L Systems.
Theor. Comput. Sci., 1980

Every Two Equivalent D0L Systems have a Regular True Envelope.
Theor. Comput. Sci., 1980

Tree Transducers, L Systems, and Two-Way Machines.
J. Comput. Syst. Sci., 1980

Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages.
J. ACM, 1980

The Sequence Equivalence Problem is Decidable for 0S Systems.
J. ACM, 1980

Restrictions, extensions, and variations of NLC grammars.
Inf. Sci., 1980

On the structure of node-label-controlled graph languages.
Inf. Sci., 1980

On the Emptiness of the Intersection of Two D0S Languages Problem.
Inf. Process. Lett., 1980

A note on M-growth functions of FTOL systems with rank.
Fundam. Inform., 1980

On metalinear ETOL systems.
Fundam. Inform., 1980

Simple EOL forms under uniform interpretation generating CF languages.
Fundam. Inform., 1980

Synchronized and desynchronized E0L forms.
Discrete Applied Mathematics, 1980

Many-to-one simulation in E0L forms is decidable.
Discrete Applied Mathematics, 1980

Context-Free Grammars With Selective Rewriting.
Acta Inf., 1980

Node-Label Controllel Graph Grammars.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

DOS Systems and Languages.
Proceedings of the Automata, 1980

1979
Equality Languages and Fixed Point Languages
Information and Control, October, 1979

Programs for Instruction Machines
Information and Control, April, 1979

On Recursion in ET0L Systems.
J. Comput. Syst. Sci., 1979

On ET0L Systems with Rank.
J. Comput. Syst. Sci., 1979

Pure interpretations for EOL forms.
ITA, 1979

Persistent ET0L systems.
Inf. Sci., 1979

Parallelism and synchronization in two-level metacontrolled substitution grammars.
Inf. Sci., 1979

Finding a Homomorphism Between Two Words is NP-Complete.
Inf. Process. Lett., 1979

An Observation on Scattered Grammars.
Inf. Process. Lett., 1979

Extending the Notion of Finite Index.
Proceedings of the Automata, 1979

A Systematic Approach to Formal Language Theory Through Parallel Rewriting.
Proceedings of the Automata, 1979

1978
On the Effect of the Finite Index Restriction on Several Families of Grammars
Information and Control, December, 1978

Increasing the Similarity of EOL Form Interpretations
Information and Control, September, 1978

Simplifications of Homomorphisms
Information and Control, September, 1978

On ET0L Systems of Finite Index
Information and Control, July, 1978

Elementary Homomorphisms and a Solution of the D0L Sequence Equivalence Problem.
Theor. Comput. Sci., 1978

E0L Languages are not Codings of FP0L Languages.
Theor. Comput. Sci., 1978

On the Structure of Derivations in Deterministic ET0L Systems.
J. Comput. Syst. Sci., 1978

Rewriting systems with a clocking mechanism.
Inf. Sci., 1978

Priorities on context conditions in rewriting systems.
Inf. Sci., 1978

A note on DOL length sets.
Discrete Mathematics, 1978

Two-Level Meta-Controlled Substitution Grammars.
Acta Inf., 1978

Tree Transducers, L Systems and Two-Way Machines (Extended Abstract)
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

Cooperating Grammar Systems.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

Simple EOL Forms under Uniform Interpretation Generating CF Languages.
Proceedings of the Automata, 1978

Parallel Generation of Maps: Developmental Systems for Cell Layers.
Proceedings of the Graph-Grammars and Their Application to Computer Science and Biology, International Workshop, Bad Honnef, October 30, 1978

Equality Languages, Fixed Point Languages and Representations of Recursively Enumerable Languages
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977
A Note on Universal Grammars
Information and Control, June, 1977

Bibliography of L Systems.
Theor. Comput. Sci., 1977

On Some Context Free Languages That Are Not Deterministic ETOL Languages.
ITA, 1977

New squeezing mechanisms for L systems.
Inf. Sci., 1977

TIL systems and languages.
Inf. Sci., 1977

Selective Substitution Grammars (Towards a Framework for Rewriting Systems). Part 1: Definitions and Examples.
Elektronische Informationsverarbeitung und Kybernetik, 1977

Acceptors for Iteration Languages.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

Two-Level Meta-Controlled Substitution Grammars.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

L Systems of Finite Index (Extended Abstract).
Proceedings of the Automata, 1977

1976
A Relationship between ET0L and EDT0L Languages.
Theor. Comput. Sci., 1976

Context-Free Grammars with Graph-Controlled Tables.
J. Comput. Syst. Sci., 1976

A Note on K-Iteration Grammars.
Inf. Process. Lett., 1976

More on ET0L Systems versus Random Context Grammars.
Inf. Process. Lett., 1976

On Slicing of K-Iteration Grammars.
Inf. Process. Lett., 1976

On the number of subwords of everywhere growing DTOL languages.
Discrete Mathematics, 1976

On Proving that Certain Languages are not ETOL.
Acta Inf., 1976

Context-Free Programmed Grammars and ETOL Systems.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

Some Aspects of Random Context Grammars.
Proceedings of the GI - 6. Jahrestagung, Stuttgart, 29. September, 1976

1975
TOL Schemes and Control Sets
Information and Control, February, 1975

Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions.
Theor. Comput. Sci., 1975

Description of Developmental Languages Using Recurrence Systems.
Mathematical Systems Theory, 1975

Some Properties of the Class of L Languages with Interactions.
J. Comput. Syst. Sci., 1975

A Pumping Theorem for Deterministic Etol Languages.
ITA, 1975

Subword complexities of various classes of deterministic developmental languages with interactions.
International Journal of Parallel Programming, 1975

On the (Combinatorial) Structure of L Languages without Interactions
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

On (Un)predictability of Formal Languages (Extended Abstract)
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

L Systems, Sequences and Languages.
Proceedings of the GI - 5. Jahrestagung, Dortmund, 8.-10. Oktober 1975, 1975

1974
The Number of Occurrences of Letters Versus Their Distribution in Some E0L Languages
Information and Control, November, 1974

The Length Sets of D0L Languages are Uniformly Bounded.
Inf. Process. Lett., 1974

Dol sequences.
Discrete Mathematics, 1974

Generative Models for Parallel Processes.
Comput. J., 1974

Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems.
Acta Inf., 1974

Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems.
Acta Inf., 1974

Nonterminals Versus Homomorphisms in Defining Languages for Some Classes of Rewriting Systems.
Acta Inf., 1974

Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, July 29, 1974

Theory of L Systems: from the point of view of formal language theory.
Proceedings of the L Systems, 1974

Bibliography on L Systems.
Proceedings of the L Systems, 1974

D0L Systems With Rank.
Proceedings of the L Systems, 1974

Three Useful Results Concerning L Languages Without Interactions.
Proceedings of the L Systems, 1974

Generatively Deterministic L Languages. Subword Point of View.
Proceedings of the L Systems, 1974

1973
T0L Systems and Languages
Information and Control, November, 1973

A Limit Theorem for Sets of Subwords in Deterministic T0L Languages.
Inf. Process. Lett., 1973

Extension of tabled 0L-systems and languages.
International Journal of Parallel Programming, 1973

Characterization of unary developmental languages.
Discrete Mathematics, 1973

Developmental Systems with Locally Catenative Formulas
Acta Inf., 1973

1972
Errata: The Equivalence Problem for Deterministic T0L-Systems is Undecidable.
Inf. Process. Lett., 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.
Inf. Process. Lett., 1972

The Equivalence Problem for Deterministic T0L-Systems is Undecidable.
Inf. Process. Lett., 1972

Direction Controlled Programmed Grammars.
Acta Inf., 1972

Developmental Systems and Languages
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

1971
On 0L-Languages
Information and Control, November, 1971


  Loading...