Characterizations of the Dyck sets
RAIRO. Informatique théorique, Volume 11 (1977) no. 1, pp. 53-62.
@article{ITA_1977__11_1_53_0,
     author = {Wrathall, Celia},
     title = {Characterizations of the {Dyck} sets},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {53--62},
     publisher = {Centrale des revues, Dunod-Gauthier-Villars},
     address = {Montreuil},
     volume = {11},
     number = {1},
     year = {1977},
     zbl = {0354.68104},
     mrnumber = {483787},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1977__11_1_53_0/}
}
TY  - JOUR
AU  - Wrathall, Celia
TI  - Characterizations of the Dyck sets
JO  - RAIRO. Informatique théorique
PY  - 1977
DA  - 1977///
SP  - 53
EP  - 62
VL  - 11
IS  - 1
PB  - Centrale des revues, Dunod-Gauthier-Villars
PP  - Montreuil
UR  - http://www.numdam.org/item/ITA_1977__11_1_53_0/
UR  - https://zbmath.org/?q=an%3A0354.68104
UR  - https://www.ams.org/mathscinet-getitem?mr=483787
LA  - en
ID  - ITA_1977__11_1_53_0
ER  - 
%0 Journal Article
%A Wrathall, Celia
%T Characterizations of the Dyck sets
%J RAIRO. Informatique théorique
%D 1977
%P 53-62
%V 11
%N 1
%I Centrale des revues, Dunod-Gauthier-Villars
%C Montreuil
%G en
%F ITA_1977__11_1_53_0
Wrathall, Celia. Characterizations of the Dyck sets. RAIRO. Informatique théorique, Volume 11 (1977) no. 1, pp. 53-62. http://www.numdam.org/item/ITA_1977__11_1_53_0/

1. H. Alt and K. Mehlhorn, Lower Bounds for the Space Complexity of Context-Free Recognition, unpublished manuscript.

2. R. Book, On the Chomsky-Schützenberger Theorem, Technical Report, Department of Computer Science, Yale University, New Haven, Conn., 1975.

3. R. Book and S. Greibach, Quasirealtime Languages, Math. Systems Theory, Vol. 4, 1970, pp. 97-111. | MR | Zbl

4. R. Book, M. Nivat and M. Paterson, Reversal-Bounded Acceptors and Intersections of Linear Languages, SIAM J. Comput., Vol. 3, 1974, pp. 283-295. | MR | Zbl

5. P. Fischer, A. Meyer and A. Rosenberg, Counter Machines and Counter Languages, Math. Systems Theory, Vol. 2, 1968, pp. 265-283. | MR | Zbl

6. S. Ginsburg and S. Greibach, Abstract Families of Languages, Memoir 87, American Mathematical Society, Providence, R.I., 1969, pp. 1-32. | MR

7. S. Ginsburg, S. Greibach and J. Hopcroft, Pre-AFL, Memoir 87, American Mathematical Society, Providence, R.I., 1969, pp. 41-51. | MR | Zbl

8. S. Greibach, An Infinite Hierarchy of Context-Free Languages, J. Assoc. Computing Machinery, Vol. 16, 1969, pp. 91-106. | MR | Zbl

9. G. Hotz and J. Messerschmidt, Dyck-Sprachen sind in Bandkomplexitat log n analysierbar, Technical Report, Universität des Saarlandes, 1975.

10. N. Jones, Context-Free Languages and Rudimentary Attributes, Math. Systems Theory, Vol. 3, 1969, pp. 102-109. | MR | Zbl

11. M. Latteux, Cônes rationnels commutativement clos, This Journal. | Numdam | MR | Zbl

12. M. Minsky, Recursive Unsolvability of Post's Problem of Tag and other Topics in the Theory of Turing Machines, Annals of Math., Vol. 74, 1961, pp. 437-455. | MR | Zbl

13. R. Ritchie, and F. Springsteel, Language Recognition by Marking Automata, Inf. and Control, Vol. 20, 1972, pp. 313-330. | MR | Zbl

14. C. Wrathall, Subrecursive Predicates and Automata, Research Report 56, Department of Computer Science, Yale University, New Haven, Conn., 1975.

15. Y. Yu, Rudimentary Relations and Formal Languages, Ph. D. dissertation, University of California, Berkeley, Calif., 1970.