Complexity of Normal Form Grammars

@article{Kelemenov1984ComplexityON,
  title={Complexity of Normal Form Grammars},
  author={Alica Kelemenov{\'a}},
  journal={Theor. Comput. Sci.},
  year={1984},
  volume={28},
  pages={299-314}
}
Various types of grammars can be used to describe context-free languages. Such are context-free grammars and their normal form restrictions. Rewriting of a context-free grammar to an equivalent grammar in required (normal) form can cause a change of parameters of the grammar such as the number of rules, the number of nonterminals, etc. Greibach normal form grammars and position restricted grammars will be investigated from the point of view of descriptional complexity of context-free languages. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
8 Extracted Citations
7 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-7 of 7 references

A super normal form theorem for context - free grammars

  • A. Piricki-KelemenovB
  • J . ACM
  • 1983

Introduction to Formal Language Theory (Addison-Wesley

  • MA. Harrison
  • 1978

Similar Papers

Loading similar papers…