@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}, mrnumber = {483787}, zbl = {0354.68104}, 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 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/ LA - en ID - ITA_1977__11_1_53_0 ER -
Wrathall, Celia. Characterizations of the Dyck sets. RAIRO. Informatique théorique, Tome 11 (1977) no. 1, pp. 53-62. http://www.numdam.org/item/ITA_1977__11_1_53_0/
1. Lower Bounds for the Space Complexity of Context-Free Recognition, unpublished manuscript.
and ,2. On the Chomsky-Schützenberger Theorem, Technical Report, Department of Computer Science, Yale University, New Haven, Conn., 1975.
,3. Quasirealtime Languages, Math. Systems Theory, Vol. 4, 1970, pp. 97-111. | MR | Zbl
and ,4. Reversal-Bounded Acceptors and Intersections of Linear Languages, SIAM J. Comput., Vol. 3, 1974, pp. 283-295. | MR | Zbl
, and ,5. Counter Machines and Counter Languages, Math. Systems Theory, Vol. 2, 1968, pp. 265-283. | MR | Zbl
, and ,6. Abstract Families of Languages, Memoir 87, American Mathematical Society, Providence, R.I., 1969, pp. 1-32. | MR
and ,7. Pre-AFL, Memoir 87, American Mathematical Society, Providence, R.I., 1969, pp. 41-51. | MR | Zbl
, and ,8. An Infinite Hierarchy of Context-Free Languages, J. Assoc. Computing Machinery, Vol. 16, 1969, pp. 91-106. | MR | Zbl
,9. Dyck-Sprachen sind in Bandkomplexitat log n analysierbar, Technical Report, Universität des Saarlandes, 1975.
and ,10. Context-Free Languages and Rudimentary Attributes, Math. Systems Theory, Vol. 3, 1969, pp. 102-109. | MR | Zbl
,11. Cônes rationnels commutativement clos, This Journal. | Numdam | MR | Zbl
,12. 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. Language Recognition by Marking Automata, Inf. and Control, Vol. 20, 1972, pp. 313-330. | MR | Zbl
, and ,14. Subrecursive Predicates and Automata, Research Report 56, Department of Computer Science, Yale University, New Haven, Conn., 1975.
,15. Rudimentary Relations and Formal Languages, Ph. D. dissertation, University of California, Berkeley, Calif., 1970.
,