Full entry |
PDF
(2.7 MB)
Feedback

References:

[1] Čulík K.: **Classifications of programming theories and languages**. Information Processing Machines 17 (in print) .

[2] Čulík K.: **Some notes on finite state languages and events represented by finite automata using labelled graphs**. Čas. pro pěst. mat. 86 (1961), 43 - 55. MR 0130062

[3] Čulík K.: **Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers**. Aplikace mat. 16 (1971), 188 - 202. MR 0309358

[4] Čulík K.: **Algorithmization of algebras and relational structures**. Commentationes Mathematicae Universitatis Carolinae 13, 3 (1972), 457-477. MR 0317574

[5] Engeler E.: **Algorithmic Approximations**. Journal of Computer and System Sciences 5 (1971), 67-82. DOI 10.1016/S0022-0000(71)80008-9 | MR 0293874 | Zbl 0238.68016