scientific article; zbMATH DE number 3421926
From MaRDI portal
Publication:5684248
Cited in
(11)- Subword complexities of various classes of deterministic developmental languages without interactions
- On the number of subwords of everywhere growing DTOL languages
- Classes of formal grammars
- Some remarks about stabilizers
- Subword complexities of various classes of deterministic developmental languages with interactions
- scientific article; zbMATH DE number 3553774 (Why is no real title available?)
- A bound for theω-equivalence problem of polynomial D0L systems
- The finiteness problem for monoids of morphisms.
- Repetitiveness measures based on string morphisms
- On the ratio of growth functions in EDTOL languages
- Analyzing ultimate positivity for solvable systems
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 Q5684248)