Characterizations of the Dyck sets
Open Access
- 1 January 1977
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 11 (1) , 53-62
- https://doi.org/10.1051/ita/1977110100531
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Reversal-Bounded Acceptors and Intersections of Linear LanguagesSIAM Journal on Computing, 1974
- Language recognition by marking automataInformation and Control, 1972
- Quasi-realtime languagesTheory of Computing Systems, 1970
- Context-free languages and rudimentary attributesTheory of Computing Systems, 1969
- Studies in abstract families of languagesMemoirs of the American Mathematical Society, 1969
- An Infinite Hierarchy of Context-Free LanguagesJournal of the ACM, 1969
- Counter machines and counter languagesTheory of Computing Systems, 1968
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961