VOLUME 9 2004 NUMBERS 2–3
Descriptional Complexity of Rewriting P Systems
Mutyam Madhu
Pages 311–316



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2004-311,
  author  = {Mutyam Madhu},
  title   = {Descriptional Complexity of Rewriting P Systems},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {9},
  number  = {2--3},
  pages   = {311--316},
  year    = {2004},
  url     = {https://doi.org/10.25596/jalc-2004-311},
  doi     = {10.25596/jalc-2004-311}
}
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: rewriting P systems, context-free grammars, descriptional complexity
DOI: 10.25596/jalc-2004-311