scientific article; zbMATH DE number 3802813
From MaRDI portal
Publication:4746787
Cited in
(only showing first 100 items - show all)- On the size of the alphabet and the subword complexity of square-free DOL languages
- On the equivalence of some transductions involving letter to letter morphisms on regular languages
- Code properties and homomorphisms of DOL systems
- Computation theory of cellular automata
- Concerning two-adjacent context-free languages
- Inference algorithms for developmental systems with cell lineages
- Caractérisation des ensembles normaux substitutifs. (Characterization of normal substitutional sets)
- Context-free grammars with selective rewriting
- EOL and ETOL array languages
- Recurrent sets
- Abstract grammars based on transductions
- Prescribed teams of grammars
- Some decision problems for parallel communicating grammar systems
- Periodic endomorphisms of a free monoid
- Neuronal growth via hybrid system of self-growing and diffusion based grammar rules. I
- A new bound for the D0L language equivalence problem
- Hierarchies of parallel rewriting P systems -- a survey
- On the number of components in cooperating distributed grammar systems
- On the deficit of a finite set of words
- Hierarchie et fermeture de certaines classes de tag-systèmes
- On grammatical complexity of a class of attractors
- On the equivalence problem of context-free and DT0L languages
- On problems related to growth, entropy, and spectrum in group theory
- Computation of sharp estimates of the Poincaré constant on planar domains with piecewise self-similar boundary
- Substitutive systems and a finitary version of Cobham's theorem
- The complexity of solution sets to equations in hyperbolic groups
- Logarithmic equal-letter runs for BWT of purely morphic words
- Inference of bounded L systems with polymorphic P systems
- Finite state and finite stop quantum languages
- Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes
- Measure theoretic entropy of random substitution subshifts
- Restricted use of the splicing operation1
- Lamination languages
- P systems with chained rules
- L-systems in geometric modeling
- Systolic automata and P systems
- One-sided random context grammars: a survey
- P and dP automata: a survey
- On some biologically motivated control devices for parallel rewriting
- ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
- On the Images of ℕ-Rational Sequences Counting Multiplicities
- Generative capacity of subregularly tree controlled grammars
- ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS
- scientific article; zbMATH DE number 3858419 (Why is no real title available?)
- Stability in OL systems
- scientific article; zbMATH DE number 3866597 (Why is no real title available?)
- FURTHER RESULTS ON P SYSTEMS WITH PROMOTERS/INHIBITORS
- Comparing subword occurrences in binary D0L sequences
- THE D0L ω-EQUIVALENCE PROBLEM
- P systems with toxic objects
- Fuzzy L-systems
- Loops in automata and HDTOL relations
- Comparison of basic language generating devices (non-deterministic systems)
- Elementariness of a finite set of words is co-NP-complete
- On the Computational Power of Enhanced Mobile Membranes
- D0L sequence equivalence is inPfor fixed alphabets
- Periodicity Problem of Substitutions over Ternary Alphabets
- Extending regular expressions with homomorphic replacement
- Undecidability of Operation Problems for T0L Languages and Subclasses
- DYNAMICALLY FORMED CLUSTERS OF AGENTS IN ECO-GRAMMAR SYSTEMS
- Christoffel and Fibonacci tiles
- scientific article; zbMATH DE number 3808975 (Why is no real title available?)
- A remark on regularity of parallel languages
- Closure properties of selective substitution grammars part I
- Closure properties of selective substitution grammars
- scientific article; zbMATH DE number 3902061 (Why is no real title available?)
- scientific article; zbMATH DE number 3911718 (Why is no real title available?)
- A combinatorial property of EOL languages
- scientific article; zbMATH DE number 3961004 (Why is no real title available?)
- On some open problems about marcus contextual languages
- On the computational power of totalistic cellular automata
- Sur les centres de DOL-langages
- Complete symmetry in d2l systems and cellular automata
- Index on etol array languages
- Density of grammar forms. part I
- Density of grammar forms part II
- Machine characterization of eol-regular matrix systems
- Fairness on synchronized eol array systems
- Hierarchy ofk-context-free languages
- EOL forms and finite substitutions of ol forms
- scientific article; zbMATH DE number 3780589 (Why is no real title available?)
- Expanded subalphabets in the theories of languages and semigroups†
- Filamentous systems with apical growth
- Cut point languages of markov DTOL systems
- Transductions and the parallel generation of languages†
- On cooperating/distributed grammar systems with different styles of acceptance
- Uniform rewriting based on permutations
- On Sequences Defined by D0L Power Series
- Elliptic curves and Fibonacci numbers arising from Lindenmayer system with symbolic computation
- On lindenmayerian rational subsets of monoids
- Complexity of E0L structural equivalence
- On infinite HD0L words having sparse letters
- If a DOL language is k-power free then it is circular
- Examples of Morphological Calculus
- Generalized Sturmian languages
- Grammar systems: a grammatical approach to distribution and cooperation
- Cellworks with cell rewriting and cell packing for plant morphogenesis
- Subapical bracketed L-systems
- scientific article; zbMATH DE number 2156384 (Why is no real title available?)
- Decidability of periodicity for infinite words
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 Q4746787)
