VOLUME 18 2013 NUMBER 1
On the Descriptional Complexity of k-Uniformly-Limited Lindenmayer Systems
Steffen Harbich
Pages 3–25



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2013-003,
  author  = {Steffen Harbich},
  title   = {On the Descriptional Complexity of $k$-Uniformly-Limited {L}indenmayer Systems},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {18},
  number  = {1},
  pages   = {3--25},
  year    = {2013},
  url     = {https://doi.org/10.25596/jalc-2013-003},
  doi     = {10.25596/jalc-2013-003}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: Lindenmayer systems, descriptional complexity, number of productions, k-uniformly-limited
DOI: 10.25596/jalc-2013-003