Skip to main content
SpringerLink
Log in

Tabular programs and discrete transducers. I

  • 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, “Abstract theory of automata,” Usp. Mat. Nauk,16, No. 5 (1961).

  2. V. M. Glushkov and A. A. Letichevskii, “Theory of discrete transducers”, in: Selected Aspects of Algebra and Logic [in Russian], Sib. Otd., Nauka, Novosibirsk (1971).

    Google Scholar 

  3. A. A. Letichevskii, “Functional equivalence of discrete transducers. I,” Kibernetika, No. 2 (1969).

  4. A. A. Letichevskii, “Equivalence of automata with final state. I,” Kibernetika, No. 4 (1966).

  5. A. A. Letichevskii, “Equivalence of automata with final state. II,” Kibernetika, No. 1 (1967).

  6. A. A. Letichevskii, “Equivalence of automata relative to semigroups”, in: Theoretical Cybernetics [in Russian], No. 6, Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1970).

    Google Scholar 

  7. Yu. G. Shukuryan, “On the optimization of loopfree automata with final state,” Kibernetika, No. 2 (1967).

  8. Yu. G. Shukuryan, “Loopfree automata with final state, optimal with respect to mean operating speed,” Kibernetika, No. 4 (1968).

  9. Yu. G. Shukuryan, “Synthesis of optimal control automaton in the class of equivalence relative to the composition of a free and a finite automaton”, in: Automata Theory and Methods for the Formalized Synthesis of Computers and Computing Systems [in Russian], Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1969).

    Google Scholar 

  10. Yu. G. Shukuryan et al., “Subsystem of automating microprogramming,” in: Computing Techniques [in Russian], Kaunas (1975).

  11. Yu. G. Shukuryan, “On the mean operating speed of automata with final state,” in: Programming Theory [in Russian], Vol. 1, Novosibirsk (1973).

  12. V. S. Tanaev and M. P. Povarich, Design of Graph-Circuits of Decision-Making Algorithms [in Russian], Nauka i Tekhnika, Minsk (1974).

    Google Scholar 

  13. H. J. Myers, “Compiling optimized code from decision tables,” IBM J. Res. Devel. (1972).

  14. S. L. Pollack, Decision Tables: Theory and Practice, J. Wiley and Sons, Inc., New York (1971).

    Google Scholar 

  15. L. T. Reinwald and R. M. Soland, “Conversion of limited-entry decision tables to optimal computer programs. I: Minimum average processing time,” J. ACM,13, No. 3 (1966).

  16. J. C. Cavouras, “On the conversion of programs to decision tables: method and objectives,” Commun. ACM,17, No. 8 (1974).

Download references

Authors
  1. Yu. G. Shukuryan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. K. Ter-Akopov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 8–14, May–June, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shukuryan, Y.G., Ter-Akopov, A.K. Tabular programs and discrete transducers. I. Cybern Syst Anal 14, 328–334 (1978). https://doi.org/10.1007/BF01074661

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation