[1] F. Dejean M. P. Schützenberger:
On a question of Eggan. Information and Control 9 (1966), 23-25.
MR 0191762
[2] S. Ginsburg: Some recursively unsolvable problems in ALGOL-like languages. SDC document SP-670, June 1962.
[3] S. Ginsburg:
The mathematical theory of context-free languages. McGraw-Hill, New York 1966.
MR 0211815 |
Zbl 0184.28401
[4] J. Gruska:
A characterization of context-free languages. Information and Control 14 (1970), 152-179.
MR 0253836
[5] J. Gruska:
A characterization of context-free languages. J. Comput. Sci. 5 (1971), 353-364.
MR 0327090 |
Zbl 0226.68035
[6] J. Gruska:
Complexity and unambiguity of context-free grammars and languages. Information and Control 18 (1971), 502-519.
MR 0311152 |
Zbl 0238.68022
[8] M. K. Yntema:
Cap expressions for context-free languages. Information and Control 18 (1971), 311-318.
MR 0286606 |
Zbl 0221.68042