Greibach normal form complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 32)
The connections are established between full and bounded grammatical complexity measures of context-free languages for the case of Greibach normal form grammars and some known complexity measures.
KeywordsNormal Form Complexity Measure Matrix Algorithm Mathematical Institute Slovak Academy Phrase Structure Grammar
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Greibach, S.A., A new normal form theorem for context-free phrase structure grammars. J.Assoc.Comp.Mach. 12(1965), 42–52.Google Scholar
- 3.Gruska, J., On the size of context-free grammars. Kybernetika 8 (1972) 213–218.Google Scholar
- 4.Gruska, J., Descriptional complexity of context-free languages. Proceedings of MFCS 73 (1973), 71–83.Google Scholar
- 5.Hopcroft, J., Ullman, J., Formal languages and their relation to automata. Addision-Wesley Publishing Co. 1969.Google Scholar
- 6.Pirická, A., Complexity and Normal forms of CFL. Lecture Notes in Comp. Sci. 28 (1975), 292–297.Google Scholar
- 7.Pirická-Kelemenová, A., Bounded grammatical complexity of CFL. (submitted for publication).Google Scholar
- 8.Rosenkrantz, D., Matrix equations and normal forms for context-free grammars. J.Assoc.Comput.Mach.14, (1967), 501–507.Google Scholar
© Springer-Verlag Berlin Heidelberg 1975