scientific article; zbMATH DE number 3569855

Cited in

(only showing first 100 items - show all)

The class of HDT0L sequences is closed with respect to rational functions
Studies in uniformity
Synchronized EOL forms
On binary equality sets and a solution to the test set conjecture in the binary case
On subword complexity functions
Code properties and homomorphisms of DOL systems
Hierarchies of hyper-AFLs
An inverse homomorphic characterization of full principal AFL
Inverse morphic equivalence on languages
On test sets for checking morphism equivalence on languages with fair distribution of letters
Fair derivations in E0L systems
Extended macro grammars and stack controlled machines
Test sets for morphisms with bounded delay
The undecidability of form equivalence for context-free and EOL forms
On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages
Adherences of DOL languages
Recurrent words and simultaneous growth in T0L systems
On coordinated selective substitutions: Towards a unified theory of grammars and machines
Pattern selector grammars and several parsing algorithms in the context- free style
Applications of scheduling theory to formal language theory
On erasing in E0L forms
Context dependent table matrix L systems
Concerning two-adjacent context-free languages
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
The equivalence of finite valued transducers (on HDT0L languages) is decidable
Periodic D0L languages
Balance of many-valued transductions and equivalence problems
Bounded D0L languages
On a public-key cryptosystem based on iterated morphisms and substitutions
The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
C-tree systolic automata
On the length of word chains
Sur l'ensemble normal des substitutions de longueur quelconque. (On the normal set of substitutions of arbitrary length)
A defect property of codes with unbounded delays
A representation of recursively enumerable languages by two homomorphisms and a quotient
A cryptanalytic observation concerning systems based on language theory
Observations concerning a public-key cryptosystem based on iterated morphisms
On the degree of synchronization of k1TOL and k1ETOL systems
The generating function of the number of subpatterns of a DOL sequence
Many-to-one simulation in EOL forms is decidable
Persistent ETOL systems
Mots sans carre et morphismes iterés
Synchronized and desynchronized EOL forms
Test sets and checking words for homomorphism equivalence
On ambiguity in EOL systems
Sur les séries associees à certains systèmes de Lindenmayer
On the emptiness of the intersection of two DOS languages problem
On pure, terminal invariant and nonterminal invariant interpretations of EOL forms
Context-free like restrictions on selective rewriting
Recursion and pumping in L forms
The inclusion of D0L in multi-reset
On the subword complexity of square-free DOL languages
Decidability and density in two-symbol grammar forms
A three-restricted normal form theorem for ETOL languages
On form-equivalence of deterministic pure grammar forms
Table systems with unconditional transfer
A note on the similarity depth
Basic formulas and languages. I: The theory
Basic formulas and languages. II: Applications to EOL systems and forms
The decidability of the DOL-DTOL equivalence problem
On infinite words obtained by iterating morphisms
Finite DOL languages and codes
On the subword complexity of locally catenative DOL languages
Systolic trees and systolic language recognition by tree automata
DOL schemes and the periodicity of string embeddings
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 behavioral properties of homogeneous structures
On the decidability of the sequence equivalence problem for DOL-systems
New squeezing mechanisms for L systems
On complements of unary L languages
A note on DOL length sets
EOL languages are not codings of FPOL languages
A note on language equations involving morphisms
On the structure of derivations in deterministic ETOL systems
A note on asynchronous cellular automata
The decidability of the FOL-DOL equivalence problem
Elementary homomorphisms and a solution of the DOL sequence equivalence problem
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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140407)