Comparisons and reset machines

1. B. Baker and R. Book, Reversal-bounded multipushdown machines, J. Comput. System Sci. 8 (1974), 315–332.

   Google Scholar 

2. R. Book, M. Nivat, and M. Paterson, Reversal-bounded acceptors and intersections of linear languages, SIAM J. Computing 3 (1974), 283–295.

   Article  Google Scholar 

3. R. Book, Simple representations of certain classes of languages, J. Assoc. Comput. Mach. 25 (1978), 23–31.

   Google Scholar 

4. R. Book and C. Wrathall, On languages specified by relative acceptance, Theoretical Computer Science, to appear.

   Google Scholar 

5. R. Book and C. Yap, On the computational power of reversal-bounded machines, Automata, Languages, and Programming, Springer-Verlag Lecture Notes in Computer Science 52 (1977), 111–119.

   Google Scholar 

6. S. Greibach, One-way finite visit automata, Theoretical Computer Science, to appear.

   Google Scholar 

7. K. Klingenstein, ρ-matrix languages, Theoretical Computer Science, to appear.

   Google Scholar 

8. S. Greibach and S. Ginsburg, Multi-tape AFA, J. Assoc. Comput. Mach. 19 (1972), 193–221.

   Google Scholar 

9. R. Siromoney, Finite-turn checking automata, J. Comput. System Sci. 5 (1971), 549–559.

   Google Scholar 

10. R. Book and M. Nivat, Linear languages and the intersection closures of classes of languages, SIAM J. Computing 7 (1978), to appear.

    Google Scholar 

11. S. Ginsburg and S. Greibach, Principal AFL, J. Comput. System Sci. 4 (1970), 308–338.

    Google Scholar 

Download references