Person:537812: Difference between revisions

From MaRDI portal
Person:537812
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Grzegorz Rozenberg to Grzegorz Rozenberg: Duplicate
 
(No difference)

Latest revision as of 16:58, 9 December 2023

Available identifiers

zbMath Open rozenberg.grzegorzDBLPr/GrzegorzRozenbergWikidataQ5612543 ScholiaQ5612543MaRDI QIDQ537812

List of research outcomes

PublicationDate of PublicationType
Decomposition of infinite labeled 2-structures2024-01-29Paper
Reaction Systems, Transition Systems, and Equivalences2023-06-30Paper
CIRCULARITY AND OTHER INVARIANTS OF GENE ASSEMBLY IN CILIATES2022-12-06Paper
Facilitation in reaction systems2021-09-14Paper
A model for the origin of internal eliminated segments (IESs) and gene rearrangement in stichotrichous ciliates2020-10-28Paper
Plug-in context providers for reaction systems2020-08-17Paper
Template-guided recombination for IES elimination and unscrambling of genes in stichotrichous ciliates2020-05-06Paper
Reaction systems with influence on environment2020-02-24Paper
Networks of Reaction Systems2020-02-21Paper
Graph transformation through graph surfing in reaction systems2019-11-28Paper
https://portal.mardi4nfdi.de/entity/Q49672432019-07-03Paper
Linking Reaction Systems with Rough Sets2019-05-24Paper
https://portal.mardi4nfdi.de/entity/Q46211512019-02-08Paper
Theory of 2-structures2019-01-10Paper
Group based graph transformations and hierarchical representations of graphs2019-01-10Paper
Reaction Systems: A Model of Computation Inspired by the Functioning of the Living Cell2018-09-20Paper
Graph surfing by reaction systems2018-08-24Paper
Model checking temporal properties of reaction systems2018-05-16Paper
Evolving reaction systems2017-06-15Paper
Applying regions2016-12-19Paper
Pancyclicity in switching classes2016-06-16Paper
Standard and ordered zoom structures2015-12-10Paper
HAIRPIN LANGUAGES2015-04-30Paper
ZOOM STRUCTURES AND REACTION SYSTEMS YIELD EXPLORATION SYSTEMS2014-11-14Paper
RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS2014-03-24Paper
Tree transducers, L systems and two-way machines (Extended Abstract)2014-03-14Paper
Membrane Systems with Marked Membranes2013-12-06Paper
Bridging Membrane and Reaction Systems – Further Results and Research Topics2013-11-28Paper
Step semantics of Boolean nets2013-06-26Paper
In Memoriam: Carl Adam Petri2013-05-31Paper
Minimal Reaction Systems2013-04-03Paper
Reaction Systems: A Natural Computing Approach to the Functioning of Living Cells2013-02-26Paper
STABILITY AND CHAOS IN REACTION SYSTEMS2013-01-18Paper
Relevance of Entities in Reaction Systems2012-11-01Paper
Preface2012-10-11Paper
Preface2012-10-11Paper
A Formal Framework for Processes Inspired by the Functioning of Living Cells2012-09-20Paper
A TOUR OF REACTION SYSTEMS2012-08-29Paper
Representing Reaction Systems by Trees2012-06-15Paper
https://portal.mardi4nfdi.de/entity/Q31009202011-11-22Paper
Reaction Systems with Duration2011-06-24Paper
On aggregation in multiset-based self-assembly of graphs2011-05-23Paper
FUNCTIONS DEFINED BY REACTION SYSTEMS2011-02-23Paper
Reaction Systems: A Model of Computation Inspired by Biochemistry2010-08-31Paper
COMBINATORICS OF LIFE AND DEATH FOR REACTION SYSTEMS2010-06-18Paper
COMPUTING MORPHISMS BY SPIKING NEURAL P SYSTEMS2010-01-29Paper
https://portal.mardi4nfdi.de/entity/Q33959812009-09-15Paper
https://portal.mardi4nfdi.de/entity/Q33959942009-09-15Paper
REDUCTION GRAPHS FROM OVERLAP GRAPHS FOR GENE ASSEMBLY IN CILIATES2009-06-23Paper
Aspects of Molecular Computing2009-05-14Paper
Simple Operations for Gene Assembly2009-04-02Paper
Introducing time in reaction systems2009-03-02Paper
Summary of the Workshop on Natural Computing and Graph Transformations2008-11-20Paper
Membrane systems with proteins embedded in membranes2008-11-06Paper
Patterns of simple gene assembly in ciliates2008-10-17Paper
Graph Transformation Units – An Overview2008-06-19Paper
https://portal.mardi4nfdi.de/entity/Q35051202008-06-18Paper
https://portal.mardi4nfdi.de/entity/Q35051242008-06-18Paper
https://portal.mardi4nfdi.de/entity/Q53849822008-04-29Paper
https://portal.mardi4nfdi.de/entity/Q54483032008-03-20Paper
From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates2008-02-26Paper
Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation2007-11-13Paper
Biochemical Reactions as Computations2007-11-13Paper
Theory Inspired by Gene Assembly in Ciliates2007-09-06Paper
Membrane Systems with External Control2007-09-03Paper
Formalizing Spherical Membrane Structures and Membrane Proteins Populations2007-09-03Paper
Graph Transformations2007-06-21Paper
Events and modules in reaction systems2007-05-11Paper
The construction of minimal DNA expressions2007-04-19Paper
Application of mismatch detection methods in DNA computing2007-04-19Paper
Parallelism in gene assembly2007-04-19Paper
Cycles and communicating classes in membrane systems and molecular dynamics2007-03-27Paper
https://portal.mardi4nfdi.de/entity/Q34255692007-02-26Paper
https://portal.mardi4nfdi.de/entity/Q34255712007-02-26Paper
https://portal.mardi4nfdi.de/entity/Q34255812007-02-26Paper
https://portal.mardi4nfdi.de/entity/Q34160752007-01-19Paper
Finite metrics in switching classes2007-01-09Paper
https://portal.mardi4nfdi.de/entity/Q34099792006-11-21Paper
Membrane Computing2006-11-13Paper
DNA Computing2006-10-19Paper
DNA Computing2006-10-19Paper
DNA Computing2006-10-19Paper
SPIKE TRAINS IN SPIKING NEURAL P SYSTEMS2006-08-21Paper
Embedding linear orders in grids2006-05-26Paper
Reducibility of gene patterns in ciliates using the breakpoint graph.2006-05-18Paper
COVERS FROM TEMPLATES2006-05-10Paper
Developments in Language Theory2005-12-22Paper
Protein output for DNA computing2005-12-08Paper
Formal Methods in Software and Systems Modeling2005-12-02Paper
COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES2005-06-22Paper
DNA computing. New computing paradigms.2005-04-26Paper
Computation in living cells. Gene assembly in ciliates2005-04-26Paper
https://portal.mardi4nfdi.de/entity/Q46687452005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q46687462005-04-15Paper
Theory Is Forever2005-01-18Paper
Zebra factorizations in free semigroups.2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q47376672004-08-11Paper
Transitivity of local complementation and switching on graphs.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44388002003-12-10Paper
Membrane systems with promoters/inhibitors2003-09-01Paper
https://portal.mardi4nfdi.de/entity/Q44217252003-09-01Paper
https://portal.mardi4nfdi.de/entity/Q44120952003-07-13Paper
Forbidding--enforcing systems2003-05-14Paper
DNA computing by blocking2003-05-14Paper
https://portal.mardi4nfdi.de/entity/Q47844732003-03-12Paper
Formal systems for gene assembly in ciliates.2003-01-22Paper
Topics in the theory of DNA computing.2003-01-21Paper
A guide to membrane computing.2003-01-21Paper
Restricted use of the splicing operation12002-12-19Paper
https://portal.mardi4nfdi.de/entity/Q47821202002-11-27Paper
https://portal.mardi4nfdi.de/entity/Q43290142002-11-14Paper
Models of molecular computing based on molecular reactions2002-09-30Paper
https://portal.mardi4nfdi.de/entity/Q27766112002-09-29Paper
Characterizing the micronuclear gene patterns in ciliates2002-09-25Paper
How ciliates manipulate their own DNA -- A splendid example of natural computing2002-09-18Paper
String and graph reduction systems for gene assembly in ciliates2002-09-11Paper
Sequences of languages in forbidding-enforcing families2002-07-25Paper
Gene assembly through cyclic graph decomposition2002-07-18Paper
ICALP, EATCS and Maurice Nivat2002-07-15Paper
https://portal.mardi4nfdi.de/entity/Q45299762002-05-07Paper
Formal properties of PA-matching2002-03-03Paper
Membrane systems with carriers2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q42639492001-08-07Paper
https://portal.mardi4nfdi.de/entity/Q27075262001-07-08Paper
https://portal.mardi4nfdi.de/entity/Q45270582001-06-27Paper
https://portal.mardi4nfdi.de/entity/Q47623322001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q45028072001-04-19Paper
https://portal.mardi4nfdi.de/entity/Q45202672001-02-26Paper
A characterization of poly-slender context-free languages2001-02-06Paper
Permutations, parenthesis words, and Schröder numbers2000-11-02Paper
https://portal.mardi4nfdi.de/entity/Q45028052000-09-12Paper
https://portal.mardi4nfdi.de/entity/Q49422422000-07-20Paper
https://portal.mardi4nfdi.de/entity/Q49422642000-07-20Paper
https://portal.mardi4nfdi.de/entity/Q44926802000-07-17Paper
On strongly context-free languages2000-07-11Paper
https://portal.mardi4nfdi.de/entity/Q44851492000-06-05Paper
https://portal.mardi4nfdi.de/entity/Q49386202000-04-25Paper
https://portal.mardi4nfdi.de/entity/Q49411412000-04-03Paper
Contexts on trajectories2000-01-31Paper
https://portal.mardi4nfdi.de/entity/Q42656171999-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42636931999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42693991999-10-31Paper
https://portal.mardi4nfdi.de/entity/Q42603631999-09-19Paper
https://portal.mardi4nfdi.de/entity/Q42472851999-06-16Paper
On representing recursively enumerable languages by internal contextual languages1999-01-12Paper
Sticker systems1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42236731999-01-06Paper
DNA computing, sticker systems, and universality1998-11-08Paper
Shuffle on trajectories: Syntactic constraints1998-08-13Paper
Simple splicing systems1998-07-28Paper
Characterizations of re languages starting from internal contextual languages1998-04-27Paper
Invariants of inversive 2-structures on groups of labels1998-03-02Paper
https://portal.mardi4nfdi.de/entity/Q43708351998-01-07Paper
https://portal.mardi4nfdi.de/entity/Q43710121998-01-07Paper
https://portal.mardi4nfdi.de/entity/Q31251781997-08-07Paper
https://portal.mardi4nfdi.de/entity/Q43410281997-06-16Paper
Geometric Transformations of Language Families: The Power of Symmetry1997-06-16Paper
Pattern systems1997-02-28Paper
Characterization and complexity of uniformly nonprimitive labeled 2-structures1997-02-28Paper
Computing by splicing1997-02-27Paper
A note on binary grammatical codes of trees1997-02-27Paper
The linear landscape of external contextual languages1996-10-27Paper
https://portal.mardi4nfdi.de/entity/Q48938591996-09-26Paper
Finite languages for the representation of finite graphs1996-07-16Paper
https://portal.mardi4nfdi.de/entity/Q48746611996-04-28Paper
https://portal.mardi4nfdi.de/entity/Q48528861995-10-25Paper
https://portal.mardi4nfdi.de/entity/Q43111961995-09-11Paper
Transition systems, event structures, and unfoldings1995-07-10Paper
https://portal.mardi4nfdi.de/entity/Q48359011995-06-08Paper
Dynamic labeled 2-structures1995-04-06Paper
Hyperedge channels are abelian1995-02-09Paper
Combinatorial properties of dependence graphs1995-01-11Paper
Prescribed teams of grammars1994-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42963021994-10-20Paper
https://portal.mardi4nfdi.de/entity/Q42963001994-10-09Paper
Incremental construction of 2-structures1994-09-15Paper
Clans and regions in 2-structures1994-07-31Paper
Context-free text grammars1994-06-02Paper
https://portal.mardi4nfdi.de/entity/Q42941731994-05-24Paper
Combinatorial properties of texts1994-04-19Paper
Properties of grammatical codes of trees1994-04-05Paper
Semantics of trees1994-03-24Paper
T-structures, T-functions, and texts1993-10-17Paper
Permutable transformation semigroups1993-08-17Paper
Handle-rewriting hypergraph grammars1993-06-29Paper
On the structure of recognizable languages of dependence graphs1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40372921993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40373131993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40373211993-05-18Paper
Computation graphs for actor grammars1993-05-16Paper
Elementary transition systems1992-09-26Paper
Angular 2-structures1992-06-28Paper
Grammatical codes of trees1992-06-26Paper
A characterization of set representable labeled partial 2-structures through decompositions1992-06-25Paper
Elementary transition systems and refinement1992-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32109091991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57504001991-01-01Paper
Nonterminal separation in graph grammars1991-01-01Paper
On structured graph grammars. II1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31988681990-01-01Paper
On structured graph grammars. I1990-01-01Paper
The complexity of regular DNLC graph languages1990-01-01Paper
Edge-label controlled graph grammars1990-01-01Paper
Partial (set) 2-structures. I: Basic notions and the representation problems1990-01-01Paper
Partial (set) 2-structures. II: State spaces of concurrent systems1990-01-01Paper
Theory of 2-structures. I: Clans, basic subclasses, and morphisms1990-01-01Paper
Theory of 2-structures. II: Representation through labeled tree families1990-01-01Paper
Primitivity is hereditary for 2-structures1990-01-01Paper
A comparison of boundary graph grammars and context-free hypergraph grammars1990-01-01Paper
Actor grammars1989-01-01Paper
Recording the use of memory in right-boundary grammars and push-down automata1988-01-01Paper
Theory of traces1988-01-01Paper
Apex graph grammars and attribute grammars1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37766361987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37835171987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859171987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859931987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859941987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859951987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859961987-01-01Paper
Combinatorial properties of boundary NLC graph languages1987-01-01Paper
Handle NLC grammars and r. e. languages1987-01-01Paper
Neighborhood-uniform NLC grammars1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37402431986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37468971986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37469041986-01-01Paper
Boundary NLC graph grammars—Basic definitions, normal forms, and complexity1986-01-01Paper
Each regular code is included in a maximal regular code1986-01-01Paper
Coordinated pair systems ; part I : Dyck works and classical pumping1986-01-01Paper
Coordinated pair systems ; part II : sparse structure of Dyck words and Ogden's lemma1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37836061986-01-01Paper
The bounded degree problem for NLC grammars is decidable1986-01-01Paper
On the membership problem for regular DNLC grammars1986-01-01Paper
Graph theoretic closure properties of the family of boundary NLC graph languages1986-01-01Paper
On the active and full use of memory in right-boundary grammars and push- down automata1986-01-01Paper
A combinatorial property of EOL languages1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37369181985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37385871985-01-01Paper
A morphic representation of EOL languages and other ETOL languages1985-01-01Paper
Traces, dependency graphs and DNLC grammars1985-01-01Paper
On coordinated selective substitutions: Towards a unified theory of grammars and machines1985-01-01Paper
On erasing in E0L forms1985-01-01Paper
Adding global forbidding context to context-free grammars1985-01-01Paper
CTS systems and Petri nets1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33473111984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33473201984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36803001984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36910701984-01-01Paper
An easy proof of Greibach normal form1984-01-01Paper
Direction independent context-sensitive grammars1984-01-01Paper
On DOS languages and DOS mappings1984-01-01Paper
On simulation and propagating EOL forms1984-01-01Paper
On inherently ambiguous E0L languages1984-01-01Paper
Note on node-rewriting graph grammars1984-01-01Paper
Commutative one-counter languages are regular1984-01-01Paper
On regularity of languages generated by copying systems1984-01-01Paper
Restrictions on NLC graph grammars1984-01-01Paper
Context free normal systems and ETOL systems1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33166151983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33166161983-01-01Paper
Repetition of subwords in DOL languages1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36574541983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36574561983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36662821983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36706051983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36712071983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36731291983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36731321983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37048961983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37048971983-01-01Paper
On sequential and parallel node-rewriting graph grammars, II1983-01-01Paper
Multi grammars1983-01-01Paper
The goodness of \(\{S,a\}\)-EOL forms is decidable1983-01-01Paper
On the subword complexity of m-free DOL languages1983-01-01Paper
On regularity of context-free languages1983-01-01Paper
Subset languages of Petri nets. I: The relationship to string languages and normal forms1983-01-01Paper
On the generative power of regular pattern grammars1983-01-01Paper
Subset languages of Petri nets. II. Closure properties1983-01-01Paper
On the size of the alphabet and the subword complexity of square-free DOL languages1983-01-01Paper
On binary equality sets and a solution to the test set conjecture in the binary case1983-01-01Paper
On the subword complexity of locally catenative DOL languages1983-01-01Paper
Representation theorems using DOS languages1982-01-01Paper
On sequential and parallel node-rewriting graph grammars1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33250621982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36574551982-01-01Paper
Using string languages to describe picture languages1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39594501982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39594511982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39684701982-01-01Paper
Corrigendum1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47437531982-01-01Paper
Studies in uniformity1982-01-01Paper
Completeness of EOL forms is decidable1982-01-01Paper
Graph grammars with neighbourhood-controlled embedding1982-01-01Paper
A note on the similarity depth1982-01-01Paper
Basic formulas and languages. II: Applications to EOL systems and forms1982-01-01Paper
The (generalized) Post correspondence problem with lists consisting of two words is decidable1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33393131981-01-01Paper
Sub context-freeLforms1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39191061981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39206681981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39221921981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39221931981-01-01Paper
EOL forms and finite substitutions of ol forms1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39236241981-01-01Paper
Sequential, continuous and parallel grammars1981-01-01Paper
On Etol Systems with Finite Tree-Rank1981-01-01Paper
On fixed, terminal fixed and nonterminal fixed interpretations of E0L forms1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39392591981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39408671981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39486111981-01-01Paper
A Morphic Representation of Complements of Recursively Enumerable Sets1981-01-01Paper
A translational theorem for the class of EOL languages1981-01-01Paper
On the subword complexity of DOL languages with a constant distribution1981-01-01Paper
A characterization of context-free string languages by directed node- label controlled graph grammars1981-01-01Paper
Decision problems for node label controlled graph grammars1981-01-01Paper
On pure, terminal invariant and nonterminal invariant interpretations of EOL forms1981-01-01Paper
Context-free like restrictions on selective rewriting1981-01-01Paper
Recursion and pumping in L forms1981-01-01Paper
On the subword complexity of square-free DOL languages1981-01-01Paper
Table systems with unconditional transfer1981-01-01Paper
Basic formulas and languages. I: The theory1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38655061980-01-01Paper
A study in parallel rewriting systems1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39025301980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39040601980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39100221980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39100231980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39206671980-01-01Paper
On basic properties of DOS systems and languages1980-01-01Paper
The Sequence Equivalence Problem is Decidable for 0S Systems1980-01-01Paper
Continuous grammars1980-01-01Paper
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39392571980-01-01Paper
Synchronized, desynchronized and coordinated E0L systems1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47467871980-01-01Paper
Tree transducers, L systems, and two-way machines1980-01-01Paper
Many-to-one simulation in EOL forms is decidable1980-01-01Paper
Context-free grammars with selective rewriting1980-01-01Paper
Synchronized and desynchronized EOL forms1980-01-01Paper
On the structure of node-label-controlled graph languages1980-01-01Paper
Restrictions, extensions, and variations of NLC grammars1980-01-01Paper
On ambiguity in EOL systems1980-01-01Paper
On a bound for the DOL sequence equivalence problem1980-01-01Paper
On the emptiness of the intersection of two DOS languages problem1980-01-01Paper
Every two equivalent DOL systems have a regular true envelope1980-01-01Paper
An observation on scattered grammars1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38516431979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38546471979-01-01Paper
Equality languages and fixed point languages1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38735661979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38770591979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38995291979-01-01Paper
Programs for instruction machines1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41904811979-01-01Paper
On acceptors of iteration languages1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41973521979-01-01Paper
Finding a homomorphism between two words is NP-complete1979-01-01Paper
On recursion in ETOL systems1979-01-01Paper
On ETOL systems with rank1979-01-01Paper
Persistent ETOL systems1979-01-01Paper
Parallelism and synchronization in two-level metacontrolled substitution grammars1979-01-01Paper
Bibliography of L systems1978-01-01Paper
A note on DOL length sets1978-01-01Paper
EOL languages are not codings of FPOL languages1978-01-01Paper
Two-level meta-controlled substitution grammars1978-01-01Paper
On the structure of derivations in deterministic ETOL systems1978-01-01Paper
Elementary homomorphisms and a solution of the DOL sequence equivalence problem1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30513961978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41604301978-01-01Paper
On ETOL systems of finite index1978-01-01Paper
Increasing the similarity of EOL form interpretations1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41676011978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41680881978-01-01Paper
On the effect of the finite index restriction on several families of grammars1978-01-01Paper
Simplifications of homomorphisms1978-01-01Paper
Priorities on context conditions in rewriting systems1978-01-01Paper
Rewriting systems with a clocking mechanism1978-01-01Paper
New squeezing mechanisms for L systems1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30498331977-01-01Paper
A note on universal grammars1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41258131977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41350091977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41579571977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41624981977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41626791977-01-01Paper
A note on K-iteration grammars1976-01-01Paper
Context-free grammars with graph-controlled tables1976-01-01Paper
More on ETOL systems versus random context grammars1976-01-01Paper
On slicing of K-iteration grammars1976-01-01Paper
On proving that certain languages are not ETOL1976-01-01Paper
A note on a family of acceptors for some families of developmental languages†1976-01-01Paper
Developmental systems with fragmentation1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41201401976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41350101976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41404071976-01-01Paper
TOL schemes and control sets1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40626621975-01-01Paper
Description of developmental languages using recurrence systems1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40958211975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41350251975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41396981975-01-01Paper
Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems1974-01-01Paper
DOL sequences1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40456711974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40501751974-01-01Paper
The number of occurrences of letters versus their distribution in some EOL languages1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40604231974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40626631974-01-01Paper
The equality of EOL languages and codings of ol languages1974-01-01Paper
On a family of acceptors for some classes of developmental languages1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40964531974-01-01Paper
Generative Models for Parallel Processes1974-01-01Paper
A limit theorem for set of subwords in deterministic TOL laguages1973-01-01Paper
Development systems with locally catenative formulas1973-01-01Paper
Extension of tabled 0L-systems and languages1973-01-01Paper
TOL systems and languages1973-01-01Paper
Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems1972-01-01Paper
The equivalence problem for deterministic TOL-systems is undecidable1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41243501972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51808601972-01-01Paper
Direction controlled programmed grammars1971-01-01Paper
On 0L-Languages1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56687951971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55794921969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55886681969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56124721969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56052281968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55404561967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55619851967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55619861967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56021101967-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Grzegorz Rozenberg