Previous |  Up |  Next


[1] Bečvář J.: Real-Time and Complexity Problems in Automata Theory. Kybernetika 1 (1965), 6, 475-498.
[2] Hartmanis J., Stearns R. E.: Computational complexity of recursive sequences. In: Pгoc. of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, held at Princeton University, 1964, 82-90.
Partner of
EuDML logo