×

zbMATH — the first resource for mathematics

On a certain event recognizable in real time. (English) Zbl 0235.02033
MSC:
03D10 Turing machines and related notions
PDF BibTeX XML Cite
Full Text: EuDML
References:
[1] Bečvář J.: Real-Time and Complexity Problems in Automata Theory. Kybernetika 1 (1965), 6, 475-498. · Zbl 0192.08701
[2] Hartmanis J., Stearns R. E.: Computational complexity of recursive sequences. Proc. of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, held at Princeton University, 1964, 82-90.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.