scientific article; zbMATH DE number 7315103
From MaRDI portal
Publication:4964024
Recommendations
- ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
- On the descriptional complexity of some variants of Lindenmayer systems
- On the descriptional complexity of k-uniformly-limited Lindenmayer systems
- A comparison of the descriptional complexity of classes of limited Lindenmayer systems. II
- A comparison of the descriptional complexity of classes of limited Lindenmayer systems. I.
- Descriptional complexity of limited automata
- scientific article; zbMATH DE number 4191133
- scientific article; zbMATH DE number 3982523
- On descriptive complexity of P systems
- Descriptive complexity, lower bounds and linear time
Cited in
(6)- A comparison of the descriptional complexity of classes of limited Lindenmayer systems. I.
- ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
- ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS
- On the descriptional complexity of some variants of Lindenmayer systems
- A comparison of the descriptional complexity of classes of limited Lindenmayer systems. II
- On the descriptional complexity of k-uniformly-limited Lindenmayer 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 Q4964024)