Analysis of the non-context-free component of formal languages

Publisher Website

1 January 1976

book chapter
Published by Springer Nature in Lecture Notes in Computer Science

p. 230-236
https://doi.org/10.1007/3-540-07854-1_179

Abstract

No abstract available

Keywords

FORMAL LANGUAGE

This publication has 3 references indexed in Scilit:

Characterization of some classes of context-free languages in terms of complexity classes
Lecture Notes in Computer Science, 1975
On complexity of nondeterministic Turing machines computations
Published by Springer Nature ,1975
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM, 1967