Characterizations of the Dyck sets

Celia Wrathall

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1977)

  • Volume: 11, Issue: 1, page 53-62
  • ISSN: 0988-3754

How to cite

top

Wrathall, Celia. "Characterizations of the Dyck sets." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 11.1 (1977): 53-62. <http://eudml.org/doc/92042>.

@article{Wrathall1977,
author = {Wrathall, Celia},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {eng},
number = {1},
pages = {53-62},
publisher = {EDP-Sciences},
title = {Characterizations of the Dyck sets},
url = {http://eudml.org/doc/92042},
volume = {11},
year = {1977},
}

TY - JOUR
AU - Wrathall, Celia
TI - Characterizations of the Dyck sets
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1977
PB - EDP-Sciences
VL - 11
IS - 1
SP - 53
EP - 62
LA - eng
UR - http://eudml.org/doc/92042
ER -

References

top
  1. 1. H. ALT and K. MEHLHORN, Lower Bounds for the Space Complexity of Context-Free Recognition, unpublished manuscript. Zbl0368.68069
  2. 2. R. BOOK, On the Chomsky-Schützenberger Theorem, Technical Report, Department of Computer Science, Yale University, New Haven, Conn., 1975. 
  3. 3. R. BOOK and S. GREIBACH, Quasirealtime Languages, Math. Systems Theory, Vol. 4, 1970, pp. 97-111. Zbl0188.33102MR276019
  4. 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. Zbl0292.68023MR433992
  5. 5. P. FISCHER, A. MEYER and A. ROSENBERG, Counter Machines and Counter Languages, Math. Systems Theory, Vol. 2, 1968, pp. 265-283. Zbl0165.32002MR235932
  6. 6. S. GINSBURG and S. GREIBACH, Abstract Families of Languages, Memoir 87, American Mathematical Society, Providence, R.I., 1969, pp. 1-32. Zbl0194.31402MR297491
  7. 7. S. GINSBURG, S. GREIBACH and J. HOPCROFT, Pre-AFL, Memoir 87, American Mathematical Society, Providence, R.I., 1969, pp. 41-51. Zbl0194.31402MR297493
  8. 8. S. GREIBACH, An Infinite Hierarchy of Context-Free Languages, J. Assoc. Computing Machinery, Vol. 16, 1969, pp. 91-106. Zbl0182.02002MR238632
  9. 9. G. HOTZ and J. MESSERSCHMIDT, Dyck-Sprachen sind in Bandkomplexitat log n analysierbar, Technical Report, Universität des Saarlandes, 1975. 
  10. 10. N. JONES, Context-Free Languages and Rudimentary Attributes, Math. Systems Theory, Vol. 3, 1969, pp. 102-109. Zbl0179.02202MR265084
  11. 11. M. LATTEUX, Cônes rationnels commutativement clos, This Journal. Zbl0354.68103MR478782
  12. 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. Zbl0105.00802MR140405
  13. 13. R. RITCHIE, and F. SPRINGSTEEL, Language Recognition by Marking Automata, Inf. and Control, Vol. 20, 1972, pp. 313-330. Zbl0242.68032MR325300
  14. 14. C. WRATHALL, Subrecursive Predicates and Automata, Research Report 56, Department of Computer Science, Yale University, New Haven, Conn., 1975. 
  15. 15. Y. YU, Rudimentary Relations and Formal Languages, Ph. D. dissertation, University of California, Berkeley, Calif., 1970. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.