Cybernetics and Systems Analysis

, Volume 34, Issue 4, pp 506–517 | Cite as

Recursive information transducers: computation models

  • A. V. Anisimov
Cybernetics
Received:
  • 27 Downloads

Keywords

Program Scheme Control Space Recursive Program Computing Medium Parallel Random Access Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. M. Glushkov, “Automata theory and design of digital computer structures,“ Kibernetika, No. 1, 3–12 (1965).Google Scholar
  2. 2.
    V. M. Glushkov, “Automata theory and formal transformations of microprograms,“ Kibernetika, No. 5, 1–10 (1965).Google Scholar
  3. 3.
    V. M. Glushkov, “Minimization of microprograms and algorithm schemes,“ Kibernetika, No. 1, 1–12 (1966).Google Scholar
  4. 4.
    A. A. Lyapunov, “Logical algorithm schemes,“ Probl. Kibern., No. 1, 46–74 (1958).Google Scholar
  5. 5.
    A. A. Lyapunov, “Algebraic interpretation of programming,“ Probl. Kibern., No. 8, 234–241 (1962).Google Scholar
  6. 6.
    S. V. Yablonskii, “Basic concepts of cybernetics,“ Probl. Kibern., No. 2, 7–38 (1959).Google Scholar
  7. 7.
    Yu. I. Yanov, “Logical algorithm schemes,“ Probl. Kibern., No. 2, 75–127 (1958).Google Scholar
  8. 8.
    V. M. Glushkov and A. A. Letichevskii, “Theory of discrete transducers,“ in: Selected Topics in Algebra and Logic [in Russian], Novosibirsk (1973), pp. 5–39.Google Scholar
  9. 9.
    A. A. Letichevskii, “Functional equivalence of discrete transducers,“ Kibernetika, No. 2, 5–16 (1969); No. 2, 14–28 (1970); No. 1, 1–4 (1972).Google Scholar
  10. 10.
    A. V. Anisimov, Recursive Information Transducers [in Russian], Vishcha Shkola, Kiev (1987).Google Scholar
  11. 11.
    S. Brown, D. Gries, and T. Szyinanski, “Program schemes with pushdown stores,“ SLAM J. Comput., No. 3, 242–269 (1972).CrossRefGoogle Scholar
  12. 12.
    L. Constable and D. Gries, “Classes of program schemes“ [Russian translation], Kibern. Sb., new series, No. 14, 122–177 (1977).MATHGoogle Scholar
  13. 13.
    M. Patterson and K. Hewitt, “Comparative schematology“ [Russian translation], Kibern. Sb., new series, No. 13, 62–72 (1976).Google Scholar
  14. 14.
    A. V. Anisimov and M. M. Vyshinskaya, “Functional power of program schemes with control recursion,“ Dokl. Akad. Nauk UkrSSR, No. 2, 55–57 (1986).Google Scholar
  15. 15.
    A. V. Anisimov, “Recursive transducers over memory,“ Kibernetika, No. 3, 51–59 (1977).Google Scholar
  16. 16.
    D. E. Knuth, “Structured programming with goto statements,“ Comput. Surveys,6, 261–301 (1974).CrossRefMATHGoogle Scholar
  17. 17.
    P. Buneman and L. Levy, “The towers of Hanoi problem,“ Inform. Process. Lett.,10, No. 4, 243–244 (1980).CrossRefMATHGoogle Scholar
  18. 18.
    P. J. Hayes, “A note on the towers of Hanoi problem,“ Comput. J.,20, No. 3, 282–285 (1977).CrossRefGoogle Scholar
  19. 19.
    J. R. Walsli, “The towers of Hanoi revisited: moving tile rings by counting the moves,“ Inform. Process. Lett.,15, No. 2, 4–7 (1982).Google Scholar
  20. 20.
    M. D. Atkinson, “The cyclic towers of Hanoi,“ Inform. Process. Lett.,13, No. 3, 118–119 (1981).CrossRefMATHGoogle Scholar
  21. 21.
    J. R. Walsh, “Iteration strikes back at the cyclic towers of Hanoi,“ Inform. Process. Lett.,16, No. 2, 91–93 (1983).CrossRefMATHGoogle Scholar
  22. 22.
    N. Cohen, II, “Eliminating redundant recursive calls,“ ACM Trans. Progr. Lang. Sys.,5, No. 3, 265–299 (1983).CrossRefMATHGoogle Scholar
  23. 23.
    A. V. Anisimov and S. V. Safronyuk, “Simulating recursion by iterative algorithms,“ Programmirovanie, No. 3, 38–50 (1986).Google Scholar
  24. 24.
    A. V. Anisimov, “Stack and locally finite computations over structures with backtracking,“ Kibernetika, No. 1, 1–12 (1983).Google Scholar
  25. 25.
    W. Rytier, “The dynamic simulation of recursive and stack manipulating programs,“ Inform. Process. Lett.,13, No. 2, 58–63 (1981).CrossRefGoogle Scholar
  26. 26.
    K. D. Bird, “Tabulation techniques for recursive programs,“ ACM Comput. Surv.,12, No. 4, 403–417 (1980).CrossRefMATHGoogle Scholar
  27. 27.
    A. A. Letichevskii, “Equivalence of automata with respect to semigroups,“ Teoret. Kibern., No. 6, 3–71 (1970).Google Scholar
  28. 28.
    A. A. Letichevskii, “Equivalence of automata with a terminal state with respect to a free semigroup with right zero,“ Dokl. Akad. Nauk UkrSSR, No. 5, 1007–1009 (1968).Google Scholar
  29. 29.
    A. A. Letichevskii and L. B. Smikun, “A class of groups with decidable equivalence problem for automata,“ Dokl. Akad. Nauk UkrSSR, No. 1, 36–38 (1970).Google Scholar
  30. 30.
    A. V. Anisimov, “On group languages,“ Kibernetika, No. 4, 18–24 (1971).Google Scholar
  31. 31.
    V. M. Glushkov and A. V. Anisimov, “Church—Rosser transducers,“ Kibernetika, No. 5, 1–8 (1979).Google Scholar
  32. 32.
    A. V. Anisimov, “Labeling Church—Rosser transducers and decidable properties of tree processing,“ Dokl. Akad. Nauk SSSR, No. 5, 1033–1035 (1979).Google Scholar
  33. 33.
    J. W. Theteller and I. B. Wright, “Generalized finite automata theory with applications to a decision problem of second-order logic,“ Math. Sys. Theory, No. 1, 57–81 (1968).Google Scholar
  34. 34.
    M. O. Rabin, “Decidability of second-order theory and automata over infinite trees“ [Russian translation], Kibern. Sb., No. 8, 72–136 (1971).MATHGoogle Scholar
  35. 35.
    A. I. Kokorin and A. G. Pinus, “Decidability of extended theories,“ UMN,33, No. 2, 49–84 (1978).MATHGoogle Scholar
  36. 36.
    V. M. Glushkov and A. V. Anisimov, “Control spaces in asynchronous parallel computation,“ Kibernetika, No. 5, 1–9 (1980).Google Scholar
  37. 37.
    A. V. Anisimov and P. P. Kulyabko, “Programming parallel processes in control spaces,“ Kibernetika, No. 3, 79–88 (1984).Google Scholar
  38. 38.
    A. V. Anisimov and Yu. E. Boreisha , “ PARUS programming system and the logical structure of the PARUS machine,“ in: Abstracts of papers of 1st All-Union Conf. on Problems of Development of Supercomputers, Supersystems, and Efficiency of Their Application, Minsk, Sept. 15–17, 1987 [in Russian], Minsk (1987), pp. 101–103.Google Scholar
  39. 39.
    A. V. Anisimov, Informatics, Creativity, Recursion [in Russian], Naukova Dumka, Kiev (1988).Google Scholar
  40. 40.
    A. V. Anisimov, Computer Linguistics for Everybody [in Russian], Naukova Dumka, Kiev (1991).Google Scholar
  41. 41.
    A. V. Anisimov, “Control space of natural language structures,“ Kibernetika, No. 3, 11–17 (1990).Google Scholar
  42. 42.
    A. V. Gladkii, Natural Language Syntactic Structures in Automated Communication Systems [in Russian], Nauka, Moscow (1985).Google Scholar
  43. 43.
    J. R. Davy and P. M. Dew, Abstract Machine Models for Highly Parallel Computers, Oxford Univ. Press (1995).Google Scholar
  44. 44.
    L. G. Valiant, “A bridging model for parallel computation,“ Comm. ACM,33, No. 8, 103–111 (1990).CrossRefGoogle Scholar
  45. 45.
    L. G. Valiant, “General-purpose parallel architectures,“ in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity, North-Holland, Amsterdam (1990), pp. 943–971.Google Scholar
  46. 46.
    L. G. Valiant, “Why BSP computers?“ Aiken Comp. Lab. Techn. Report TR-26-92, Harvard Univ. (1992).Google Scholar
  47. 47.
    D. B. Skillicorn and D. Talia, Models and Languages for Parallel Computations, Queens Univ., Canada (1996).Google Scholar
  48. 48.
    E. Bernstein and U. Vazirani, “Quantum complexity theory,“ Proc. 25th Annual ACM Symp. of the Theory of Computing, USA (1993), pp. 11–30.Google Scholar
  49. 49.
    D. Boneh and R. Lipton, “Quantum cryptanalysis of hidden linear functions,“ Lect. Notes. Comput. Sci.,963, 424–437 (1995).Google Scholar
  50. 50.
    G. Brassar, “Time for another paradigm shift,“ ACM Comput. Surv.,27, No. 1, 19–21 (1995).CrossRefGoogle Scholar
  51. 51.
    P. W. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,“ Proc. 35th Annual Symp. on the Foundation of Computer Science, Santa Fe, NM (1994), pp. 124–133.CrossRefGoogle Scholar

Copyright information

© Kluwer Academic/Plenum Publishers 1999

Authors and Affiliations

  • A. V. Anisimov

There are no affiliations available

Personalised recommendations