The following pages link to Grzegorz Rozenberg (Q537812):
Displayed 50 items.
- (Q235181) (redirect page) (← links)
- Pancyclicity in switching classes (Q294726) (← links)
- On aggregation in multiset-based self-assembly of graphs (Q537813) (← links)
- The bounded degree problem for NLC grammars is decidable (Q579950) (← links)
- The goodness of \(\{S,a\}\)-EOL forms is decidable (Q584929) (← links)
- On the subword complexity of m-free DOL languages (Q594602) (← links)
- Finding a homomorphism between two words is NP-complete (Q599499) (← links)
- A note on binary grammatical codes of trees (Q672152) (← links)
- Pattern systems (Q672745) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- T-structures, T-functions, and texts (Q685376) (← links)
- How ciliates manipulate their own DNA -- A splendid example of natural computing (Q698147) (← links)
- Models of molecular computing based on molecular reactions (Q698877) (← links)
- Characterizing the micronuclear gene patterns in ciliates (Q699814) (← links)
- Applying regions (Q728281) (← links)
- On structured graph grammars. I (Q753498) (← links)
- Priorities on context conditions in rewriting systems (Q754654) (← links)
- Rewriting systems with a clocking mechanism (Q754655) (← links)
- On regularity of context-free languages (Q759489) (← links)
- Subset languages of Petri nets. I: The relationship to string languages and normal forms (Q788496) (← links)
- On DOS languages and DOS mappings (Q791326) (← links)
- On simulation and propagating EOL forms (Q793513) (← links)
- On the generative power of regular pattern grammars (Q794441) (← links)
- On inherently ambiguous E0L languages (Q796996) (← links)
- Note on node-rewriting graph grammars (Q796997) (← links)
- Subset languages of Petri nets. II. Closure properties (Q797296) (← links)
- On the subword complexity of DOL languages with a constant distribution (Q798008) (← links)
- Commutative one-counter languages are regular (Q800097) (← links)
- On regularity of languages generated by copying systems (Q800098) (← links)
- Nonterminal separation in graph grammars (Q804300) (← links)
- Finite metrics in switching classes (Q858301) (← links)
- Cycles and communicating classes in membrane systems and molecular dynamics (Q872209) (← links)
- The construction of minimal DNA expressions (Q876859) (← links)
- Application of mismatch detection methods in DNA computing (Q876862) (← links)
- Parallelism in gene assembly (Q876864) (← links)
- Events and modules in reaction systems (Q880167) (← links)
- Standard and ordered zoom structures (Q896702) (← links)
- The complexity of regular DNLC graph languages (Q909473) (← links)
- Edge-label controlled graph grammars (Q909484) (← links)
- Partial (set) 2-structures. I: Basic notions and the representation problems (Q911307) (← links)
- Partial (set) 2-structures. II: State spaces of concurrent systems (Q911308) (← links)
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms (Q913822) (← links)
- Theory of 2-structures. II: Representation through labeled tree families (Q913823) (← links)
- Primitivity is hereditary for 2-structures (Q913824) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Patterns of simple gene assembly in ciliates (Q948679) (← links)
- Membrane systems with proteins embedded in membranes (Q953537) (← links)
- Introducing time in reaction systems (Q1004076) (← links)
- On the size of the alphabet and the subword complexity of square-free DOL languages (Q1050120) (← links)
- Studies in uniformity (Q1050121) (← links)