iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/3-540-08860-1_10
Comparisons and reset machines | SpringerLink
Skip to main content
Springer Nature Link
Log in

Comparisons and reset machines

Preliminary report

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1978)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 62))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California at Santa Barbara, 93106, Santa Barbara, California, U.S.A.

    Ronald V. Book

  2. Department of System Science, University of California at Los Angeles, 90024, Los Angeles, California, U.S.A.

    Sheila A. Greibach & Celia Wrathall

Authors
  1. Ronald V. Book
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sheila A. Greibach
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Celia Wrathall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Book, R.V., Greibach, S.A., Wrathall, C. (1978). Comparisons and reset machines. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-08860-1_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08860-8

  • Online ISBN: 978-3-540-35807-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation