• DML-CZ Home

68Q05 Models of computation (Turing machines, etc.) (19 articles)

• Wiedermann, Jiří: Proč počítáme a co počítáme?. (Czech) [Why do we compute and what do we compute?]. Pokroky matematiky, fyziky a astronomie, vol. 59 (2014), issue 1, pp. 33-43
• Reidenbach, Daniel; Schmid, Markus L.: Automata with modulo counters and nondeterministic counter bounds. (English). Kybernetika, vol. 50 (2014), issue 1, pp. 66-94
• Langer, Miroslav: On hierarchy of the positioned eco-grammar systems. (English). Kybernetika, vol. 50 (2014), issue 5, pp. 696-705
• Lukáš, Roman; Meduna, Alexander: Multigenerative grammar systems and matrix grammars. (English). Kybernetika, vol. 46 (2010), issue 1, pp. 68-82
• Blatný, Petr; Bidlo, Radek; Meduna, Alexander: Automata with two-sided pushdowns defined over free groups generated by reduced alphabets. (English). Kybernetika, vol. 43 (2007), issue 3, pp. 265-278
• Case, John; Jain, Sanjay; Ngo Manguelle, Suzanne: Refinements of inductive inference by Popperian and reliable machines. (English). Kybernetika, vol. 30 (1994), issue 1, pp. 23-52
• Kratchanov, Kostadin D.; Stanev, Ivan N.; Sabotinova, Desislava S.: A fuzzy computational model implementation. (English). Kybernetika, vol. 28 (1992), issue 7, pp. 97-102
• Hromkovič, Juraj: Branching programs provide lower bounds on the area of VLSI circuits. (English). Kybernetika, vol. 27 (1991), issue 6, pp. 542-550
• Hromkovič, Juraj: Reversals-space-parallelism tradeoffs for language recognition. (English). Mathematica Slovaca, vol. 41 (1991), issue 2, pp. 121-136
• Ďuriš, Pavol: Two new proof techniques for investigating the computational power of two-way computing devices [Abstract of thesis]. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 1, pp. 197-198
• Bebják, Andrej; Štefáneková, Ivana: Nondeterminism is essential for reversal-bounded two-way multihead finite automata. (English). Kybernetika, vol. 24 (1988), issue 1, pp. 65-71
• Ďuriš, Pavol; Hromkovič, Juraj: Zerotesting bounded one-way multicounter machines. (English). Kybernetika, vol. 23 (1987), issue 1, pp. 13-18
• Hromkovič, Juraj: Hierarchy of reversal bounded one-way multicounter machines. (English). Kybernetika, vol. 22 (1986), issue 2, pp. 200-206
• Kramosil, Ivan: Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs. (English). Kybernetika, vol. 17 (1981), issue 5, pp. 359-367
• Žák, Stanislav: A Turing machine oracle hierarchy. I. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 21 (1980), issue 1, pp. 11-26
• Žák, Stanislav: A Turing machine oracle hierarchy. II. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 21 (1980), issue 1, pp. 27-39
• Žák, Stanislav: A Turing machine space hierarchy. (English). Kybernetika, vol. 15 (1979), issue 2, pp. (100)-121
• Rosenbaum, Miroslav: K metodice řešení hybridních obvodů grafy signálových toků. (Czech) [To the method of solving hybrid circuits by signal—flow graphs]. Kybernetika, vol. 5 (1969), issue 6, pp. (484)-500
• Čulík, Karel II: Sequential machines with several input and output tapes. (English). Kybernetika, vol. 3 (1967), issue 6, pp. (540)-559