VOLUME 12 2007 NUMBERS 1–2
Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars
Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt
Pages 117–138



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2007-117,
  author  = {Henning Fernau and Rudolf Freund and Marion Oswald and Klaus Reinhardt},
  title   = {Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {12},
  number  = {1--2},
  pages   = {117--138},
  year    = {2007},
  url     = {https://doi.org/10.25596/jalc-2007-117},
  doi     = {10.25596/jalc-2007-117}
}
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: matrix grammars, graph-controlled grammars, programmed grammars, nonterminal complexity, appearance checking
DOI: 10.25596/jalc-2007-117