Comments on the roots of theorems and languages both easy and hard

Authors:
S. A. Greibach
Affiliations:
University of California, Los Angeles, California
Venue:
ACM SIGACT News
Year:
1981

Citing 7
Cited 0

A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

Journal of the ACM (JACM)
Matrix Equations and Normal Forms for Context-Free Grammars

Journal of the ACM (JACM)
Formal parsing systems

Communications of the ACM
Report on the algorithmic language ALGOL 60

Communications of the ACM
Jump PDA's, deterministic context-free languages principal AFDLs and polynomial time recognition—(Extended Abstract)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Roots of the hardest context free language and other constructs

ACM SIGACT News
Formal languages and their relation to automata

Formal languages and their relation to automata

Quantified Score

Hi-index	0.00

Visualization

Abstract