EUDML | On optimum time bounds for recognition of some sets of words by on-line Turing machines

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “On optimum time bounds for recognition of some sets of words by on-line Turing machines”

Recursive functions computable within $C \bar{f} log \bar{f}$

Jiří Hořejš (1969)

Kybernetika

Similarity:

A Turing machine space hierarchy

Stanislav Žák (1979)

Kybernetika

Similarity:

On the notion of universality of Turing machine

Akihiro Nozaki (1969)

Kybernetika

Similarity: