Skip to main content
SpringerLink
Log in

Church-Rosser converters

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. V. M. Glushkov, “Theory of automata and questions of digital machine structure design,” Kibernetika, No. 1 (1965).

  2. V. M. Glushkov, “Theory of automata and formal microprogram conversion,” Kibernetika, No. 5 (1965).

  3. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Theoretical principles of discrete system design,” Kibernetika, No. 6 (1977).

  4. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “On the theory of the design of schematic and programming equipment of multiprocessor electronic computers,” Kibernetika, No. 6 (1978).

  5. E. W. Dijkstra, A Discipline of Programming, Prentice-Hall (1976).

  6. J. B. Dennis, J. B. Fosseen, and J. P. Lindermna, “Data flow schemes,” in: Theory of Programming [in Russian], Pt. II, Novosibirsk (1972).

  7. R. M. Karp, “Reducibility of combinatorial problems,” in: Cybernetic Collection [Russian translation], No. 12, Moscow (1975).

  8. R. M. Karp and R. E. Miller, “Parallel program schemes,” in: Cybernetic Collection [Russian translation], No. 13, Moscow (1976).

  9. S. A. Cook, “Complexity of theorem deduction procedures,” in: Cybernetic Collection [Russian translation], No. 12, Moscow (1975).

  10. A. A. Letichevskii, “Functional equivalence of discrete converters.” I, Kibernetika, No. 1 (1967).

  11. A. A. Letichevskii, “Equivalence of automata relative to semigroups,” in: Theoretical Cybernetics [in Russian], No. 6, Institute of Cybernetics, Academy of Sciences of the Ukrainian SSR, Kiev (1970).

    Google Scholar 

  12. A. A. Letichevskii and L. B. Smikun, “On classes of groups with solvable automata equivalence problem,” Dokl. Akad. Nauk SSSR, No. 1 (1976).

  13. M. O. Rabin, “Solvability of second order theories and automata over infinite trees,” in: Cybernetic Collection [Russian translation], No. 8, Moscow (1971).

  14. D. A. Adams, “A computation model with data flow sequencing,” Computer Science Dept. Stanford Univ., No. CS-117 (1968).

  15. A. V. Aho, R. Sethi, and J. D. Ullman, “Code optimization and finite Church-Rosser systems,” Design and Optimization of Compilers, Prentice-Hall (1972).

  16. W. S. Brainerd, “Tree generating regular systems,” Inf. Control, 14, No. 2 (1969).

  17. R. Constable and D. Gries, “On classes of program schemata,” SIAM J. Computing, 1, No. 1 (1972).

    Google Scholar 

  18. J. B. Dennis and J. B. Fosseen, “An introduction to data flow schemas,” Computations Structures Group Memo 81, Project MAC, MIT, Cambridge, Massachusetts (1972).

    Google Scholar 

  19. E. W. Dijkstra, “Guarded commands, nondeterminacy, and formal derivation of programs,” Commun. ACM,18 (1975).

  20. C. Leung, “Formal properties of well-formed data flow schemas,” Project MAC, Technical Memo 66, MIT, Cambridge, Massachusetts (1975).

    Google Scholar 

  21. M. J. O'Donnel, “Computations in systems described by equations,” Lect. Notes Computer Sci.,58, Springer-Verlag (1977).

  22. S. S. Patil, “Closure properties of interconnections of determinate systems,” Record of the Project MAC Conference on Concurrent Systems and Parallel Computation, ACM, New York (1970).

  23. C. A. Petri, “Kommunikation mit Automaten,” Schriften des Rheinisch-Westfallischen Instituts für Instrumentelle Mathematik an der Universität Bonn, No. 2, Bonn (1962).

  24. J. E. Rodriguez, “A graph model for parallel computation,” Project MAC Report, TR-64, Project MAC, MIT, Cambridge, Mass. (1968).

    Google Scholar 

  25. B. K. Rosen, “Tree manipulating systems and Church-Rosser theorems,” J. Assoc. Computing Machinery, 20, No. 1 (1973).

    Google Scholar 

  26. B. K. Rosen, “Correctness of parallel programs: the Church-Rosser approach,” Theor. Computer Sci., No. 2 (1976).

  27. R. Sethi, “Testing for the Church-Rosser property,” J. Assoc. Computer Machinery, 21, No. 4 (1974).

    Google Scholar 

  28. H. R. Strong, “High level languages of maximum power,” Proc. IEEE Conf. Switching Automata Theory, U. S. A. (1971).

  29. R. Zuczek, “A new approach to parallel computing,” Acta Inf.,7 (1976).

Download references

Authors
  1. V. M. Glushkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 1–8, September–October, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Glushkov, V.M., Anisimov, A.V. Church-Rosser converters. Cybern Syst Anal 15, 607–614 (1979). https://doi.org/10.1007/BF01071208

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01071208

Keywords

Search

Navigation