Previous |  Up |  Next

Article

References:
[1] Čulík K.: Well-translatable grammars and ALGOL-like languages. In Steel, T. B. Jr. (Ed.): Proc. IFIP Working Conference on Formal Language Description Languages. North-Holland, Amsterdam 1966, pp. 76-85.
[2] Čulík II K.: Sequential Machines with several input and output tapes. Kybernetika 3 (1967), 6, 540-559. Zbl 0155.02001
[3] Elgot C. C., Mezei J. E.: On finite relation defined by generalized automata. IBM J. of Research and Development 9 (Jan. 1965), 1, 47-68. DOI 10.1147/rd.91.0047 | MR 0216903
[4] Ginsburg S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York 1966. MR 0211815 | Zbl 0184.28401
[5] Ginsburg S., Rose G. F.: A Characterization of Machine Mappings. The Canadian Journal of Mathematics 18 (1966), 381-388. DOI 10.4153/CJM-1966-040-3 | MR 0191763 | Zbl 0143.01903
[6] Glushkov V. M.: Introduction to Cybernetics. Academic Press, New York 1966. MR 0199024
[7] Lewis II P. M., Stearns R. E.: Syntax-Directed Transduction. J. ACM 15 (July 1968), 3, 465-488. DOI 10.1145/321466.321477 | Zbl 0164.32102
Partner of
EuDML logo