On the degree of non-regularity of context-free languages

References

• Brainerd , B. 1969 . An analog of a theorem about context-free languages . Inform. Control , 11 : 561 – 567 .
   Google Scholar
• Bucher , W. , Ehrenfeucht , A. and Haussier , D. 1985 . On total regulators generated by derivation relations . Theor. Comp. Sci. , 40 : 131 – 148 .
   Google Scholar
• Dassow , J. and Paun , Gh. 1989 . On regulating context-free languages by AFL operations . Manuscript ,
   Google Scholar
• Ehrenfeucht , A. , Haussier , D. and Rozenberg , G. 1983 . On regularity of context-free languages . Theor. Comp. Sci. , 27 : 311 – 332 .
   Google Scholar
• Gruska , J. 1973 . Descriptional complexity of context-free languages . 1973 , High Tatras. pp. 71 – 83 .
   Google Scholar
• Mäkinen , E. 1988 . Two complexity measures for context-free languages . Intern. J. Comput. Math. , 26 : 29 – 34 .
   Google Scholar
• Paun , Gh. 1975 . On some measures of the syntactic complexity . Stud. Cerc. Matem. , 27 : 313 – 321 . in Romanian
   Google Scholar
• Salomaa , A. 1969 . On the index of context-free grammars and languages . Inform. Control , 14 : 474 – 477 .
   Google Scholar
• Salomaa , A. 1973 . Formal Languages , New York : Springer-Verlag . London
   Google Scholar