Publication:4140407
From MaRDI portal
zbMath0365.68072MaRDI QIDQ4140407
Arto Salomaa, Grzegorz Rozenberg
Publication date: 1976
Related Items
Parallel communicating limited and uniformly limited 0L systems, Substitutions and interval exchange transformations of rotation class, On Parikh slender context-free languages, Watson-Crick D0L systems with regular triggers, Logical string rewriting, Fuzzy \(L\) languages, Easy cases of the D0L sequence equivalence problem, On infinite words generated by polynomial D0L systems, Operations and language generating devices suggested by the genome evolution, The generative capacity of block-synchronized context-free grammars, Bounds for the D0L language equivalence problem, On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems, Structural equivalence and ET0L grammars, Quasi-deterministic 0L systems and their representation, Pattern systems, Multi-pattern languages, Completeness results concerning systolic tree automata and E0L languages, A decision method for Parikh slenderness of context-free languages, Equations over finite sets of words and equivalence problems in automata theory, On the union of 0L languages, The string generating power of context-free hypergraph grammars, Machine characterization of (E0L-E0L) array languages, Defining families of trees with E0L grammars, Iterated stack automata and complexity classes, On the rank of the subsets of a free monoid, Simple reductions between \(D0L\) language and sequence equivalence problems, The undecidability of some equivalence problems concerning ngsm's and finite substitutions, Team behaviour in eco-grammar systems, Characterizations of recursively enumerable languages by means of insertion grammars, Coupled map lattices dynamics on a variable space for the study of development: A general discussion on Caenorhabditis elegans, An inequality for non-negative matrices, On D0L systems with immigration, Some methods for generating infinite sequences, A Kleene-like characterization of languages accepted by systolic tree automata, Formal languages defined by uniform substitutions, Languages of colonies, On generalized DT0L systems and their fixed points, On developmental systems: Multilevel and parallel development, Slender 0L languages, On the Kleijn-Rozenberg k-adjacent languages, On Lindenmayerian algebraic power series, On Lindenmayerian algebraic sequences, Simple splicing systems, The Euclidean traveling salesman problem and a space-filling curve, Watson-Crick D0L systems: The power of one transition, On three variants of rewriting P systems, Languages, D0L-systems, sets of curves, and surface automorphisms., Power and size of extended Watson-Crick \(L\) systems., On images of D0L and DT0L power series., Tissue P systems., Decidability results for Watson-Crick D0L systems with nonregular triggers., Endomorphic presentations of branch groups., Watson-Crick D0L systems: Generative power and undecidable problems., Forbidding ET0L grammars., Repetitiveness of languages generated by morphisms, On D0L power series, Computing with membranes, Grouped partial ET0L systems and parallel multiple context-free grammars, Language-theoretic aspects of DNA complementarity, An algebraic characterization of the set of succession rules, Uni-transitional Watson-Crick D0L systems, Decidability of EDT0L structural equivalence, Some analytic features of algebraic data, The language equivalence problem for HD0L systems having D0L growths, Explicit test sets for iterated morphisms in free monoids and metabelian groups, Dynamically controlled cooperating/distributed grammar systems, Decidability results concerning \(k\)-limited ED0L systems, Topics in the theory of DNA computing., A guide to membrane computing., Universal computation with Watson-Crick D0L systems., The equivalence problem for DF0L languages and power series., Automatic graphs and D0L-sequences of finite graphs, On the power of membrane division in P systems, A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\), On the splicing operation, Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems, On the equivalence problem for succession rules, An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
