|
1. Equations associated with a context-free grammar |
Vasile Coardoş |
|
2. Grammatical inference based on pattern recognition |
G. B. Porter |
|
3. The structure of context-free grammaical families |
Armin Cremers and Seymour Ginsburg |
|
4. Structural equivalence of context-free grammar forms is decidable |
Hermann K.-G. Walter |
|
5. Derivation complexity in context-free grammar forms |
Seymour Ginsburg and Nancy Lynch |
|
6. The average stack size of a derivation tree generated by a linear context-free grammar |
R. Kemp |
|
7. Control sets on context-free grammar forms |
S. A. Greibach |
|
8. Size complexity in context-free grammar forms |
Seymour Ginsburg and Nancy Lynch |
|
9. The decidability of the equivalence of context-free grammar forms |
Meera Blattner |
|
10. Predictors of context-free grammars |
Kuo-Chung Tai |
|
11. An approach to the analysis of context-free languages |
Sudhir K. Arora, Lea Ginzberg and K. C. Smith |
|
12. Decidability of equivalence, containment, intersection, and separability of context-free languages |
H. B. Hunt, III and J. L. Rangel |
|
13. Lower bounds on space complexity for contextfree recognition |
Helmut Alt |
|
14. On the complexity of general context-free language parsing and recognition |
Walter L. Ruzzo |
|
15. A theory of syntactic monoids for context-free languages |
Jean-François Perrot and Jacques Sakarovitch |
|
16. Refining nondeterminism in context-free languages |
Chandra M. R. Kintala |
|
17. Strong non-deterministic context-free languages |
Joffroy Beauquier |
|
18. Succinctness of descriptions of unambiguous context-free languages |
Erik Meineche Schmidt and Thomas G. Szymanski |
|
19. On equivalence and subclass containment problems for deterministic context-free languages |
E. P. Friedman, S. A. Greibach |
|
20. On the tape comlexity of deterministic context-free languages |
I. H. Sudborough |
|
21. Simple context-free languages and free monadic recursion schemes |
Emily P. Friedman |
|
22. Context-free algebras |
W. S. Hatcher, T. Rus |
|
23. Computational parallels between the regular and context-free languages |
H. B. Hunt, III and D. J. Rosenkrantz |
|
1. Equations associated with a context-free grammar |
Vasile Coardoş |
|
2. Grammatical inference based on pattern recognition |
G. B. Porter |
|
3. The structure of context-free grammaical families |
Armin Cremers and Seymour Ginsburg |
図書
