Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference16 articles.
1. R. Book andR. Lipton, On the complexity of infinite sequences, unpublished manuscript.
2. R. Book andM. Nivat, Reversal-bounded acceptors, in preparation.
3. R. Book, M. Nivat, andM. Paterson, Reversal-bounded acceptors and Intersections of linear languages,SIAM J. Computing 3 (1974), 283–295.
4. A. Ehrenfeucht andG. Rozenberg, A pumping theorem for deterministic ETOL languages,Revue d'Automatique, Informatique, Recherche Opérationnelle (série rouge) 9 (1975), 13–23.
5. S. Ginsburg, S. Greibach, andM. Harrison, Stack automata and compiling,J. Assoc. Comput. Mach. 14 (1967), 172–201.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献