A comparative study of one-counter Ianov schemes

  • Tadashi AE
  • Toru Kikuno
  • Norio Tamura
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Valiant, L.G.,Deterministic one-counter automata, JCSS 10 (1975)340–350.Google Scholar
  2. [2]
    Manna,Z.,Mathematical theory of computation, McGraw-Hill Inc.(1974)Chap.4.Google Scholar
  3. [3]
    Garland, S.J.and D.C. Luckham,Program schemes, recursion schemes, and formal languages, JCSS 7 (1973)119–160.Google Scholar
  4. [4]
    Plaisted,D.A.,Flowchart schemata with counters, Proc.4th Annual ACM Symp. on Theory of Computing (1972)44–51.Google Scholar
  5. [5]
    Ae,T.,T.Kikuno and N.Tamura,Ianov schemes with one counter (to appear in Japanese).Google Scholar
  6. [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. [7]
    Luckham, D.C.,D.M.R. Park and M.S. Paterson,On formalized computer programs, JCSS 4 (1970)220–249.Google Scholar
  8. [8]
    Indermark, K.,On Ianov schemas with one memory location, Lecture Notes in Computer Science 2, Springer-Verlag (1973)284–293.Google Scholar
  9. [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. [10]
    Weihrauch, K.,Program schemata with polynomial bounded counters, Information Processing Letters 3 (1975)91–96.CrossRefGoogle Scholar
  11. [11]
    Tamura,N.,Some problems on program schemes, Master thesis, Dept. of Electronics, Hiroshima University (1976) (in Japanese).Google Scholar
  12. [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. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Tadashi AE
  • Toru Kikuno
  • Norio Tamura

There are no affiliations available

Personalised recommendations