Subword complexities of various classes of deterministic developmental languages with interactions
From MaRDI portal
Publication:4066603
DOI10.1007/BF01007760zbMath0308.68043OpenAlexW2054904096MaRDI QIDQ4066603
No author found.
Publication date: 1975
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01007760
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A limit theorem for set of subwords in deterministic TOL laguages
- Development systems with locally catenative formulas
- DOL sequences
- Integral sequential word functions and growth equivalence of lindenmayer systems
- A note on some systems of lindenmayer
This page was built for publication: Subword complexities of various classes of deterministic developmental languages with interactions