Karel Culik
- {Culi75} Culik, Karel. "A Note on the Comparison of Turing Machines with Computers."
Cas. pro Pest. Mat. , 100 (1975), pp. 118--128.Google Scholar
- {Culi76} Culik, Karel. "Mathematical Theory of Serial Computers."
Informatik-Fachberichte No. 1 (1976), Springer, pp. 203--234. Google ScholarDigital Library
- {Culi81a} Culik, Karel.
The Mathematical Concept of a Program and a Computer. Detroit: Wayne State University, Department of Computer Science, CSC-81-021, June 1981.Google Scholar - {Culi81b} Culik, Karel.
An Advanced Definition of a Programming Language , internal report, 12 pages.Google Scholar - {Davi58} Davis, M.
Computability and Unsolvability. McGraw-Hill, 1958.Google Scholar - {Floy67} Floyd, R. W. "Assigning Meaning to Programs."
Proceedings of a Symposium in Applied Mathematics , 19 (1967), pp. 19--32.Google ScholarCross Ref
- {Hoar69} Hoare, C. A. R. "An Axiomatic Basis of Computer Programming."
Communications of the ACM , 12 (October 1967), 576--580, 583. Google ScholarDigital Library - {LePa81} Lewis, H. R. and C. H. Papadimitriu.
Elements of the Theory of Computation. Prentice-Hall, 1981. Google ScholarDigital Library - {Mann74} Manna, Z.
Mathematical Theory of Computation. McGraw-Hill, 1974. Google ScholarDigital Library
Recommendations
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...
On stateless multihead automata: Hierarchies and the emptiness problem
We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition ...
Reversible pushdown automata
Reversible pushdown automata are deterministic pushdown automata that are also backward deterministic. Therefore, they have the property that any configuration occurring in any computation has exactly one predecessor. In this paper, the computational ...
Comments