Skip to main content
SpringerLink
Log in
SpringerLink
Log in

A comparative study of one-counter Ianov schemes

  • Vorträge In Der Reihenfolge Des Programms
  • Conference paper
  • First Online:
Theoretical Computer Science

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

  • 157 Accesses

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. Valiant, L.G.,Deterministic one-counter automata, JCSS 10 (1975)340–350.

    Google Scholar 

  2. Manna,Z.,Mathematical theory of computation, McGraw-Hill Inc.(1974)Chap.4.

    Google Scholar 

  3. Garland, S.J.and D.C. Luckham,Program schemes, recursion schemes, and formal languages, JCSS 7 (1973)119–160.

    Google Scholar 

  4. Plaisted,D.A.,Flowchart schemata with counters, Proc.4th Annual ACM Symp. on Theory of Computing (1972)44–51.

    Google Scholar 

  5. Ae,T.,T.Kikuno and N.Tamura,Ianov schemes with one counter (to appear in Japanese).

    Google Scholar 

  6. Tamura,N.,T.Kikuno and T.Ae,On Ianov schemas augmented by one counter — comparison with recursive schemas —, Tech.Report on IECE of Japan AL75-68 (1976) (in Japanese).

    Google Scholar 

  7. Luckham, D.C.,D.M.R. Park and M.S. Paterson,On formalized computer programs, JCSS 4 (1970)220–249.

    Google Scholar 

  8. Indermark, K.,On Ianov schemas with one memory location, Lecture Notes in Computer Science 2, Springer-Verlag (1973)284–293.

    Google Scholar 

  9. Tokura,N.,T.Kasami and S.Furuta,Ianov schemas augmented by a pushdown memory, Proc. 15th Annual Symp. on SWAT (1974)84–94.

    Google Scholar 

  10. Weihrauch, K.,Program schemata with polynomial bounded counters, Information Processing Letters 3 (1975)91–96.

    Article  Google Scholar 

  11. Tamura,N.,Some problems on program schemes, Master thesis, Dept. of Electronics, Hiroshima University (1976) (in Japanese).

    Google Scholar 

  12. Chandra,A.K.and Z.Manna,Program schemas with equality, Proc.4th Annual ACM Symp. on Theory of Computing (1972)52–64.

    Google Scholar 

  13. Constable,R.L.,H.B.Hunt III, and S.Sahni,On the computational complexity of scheme equivalence, Tech. Report prepared for Cornell University (1974).

    Google Scholar 

Download references

Authors
  1. Tadashi AE
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toru Kikuno
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Norio Tamura
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

AE, T., Kikuno, T., Tamura, N. (1977). A comparative study of one-counter Ianov schemes. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-08138-0_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37389-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation