THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA (Q3069734): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On a Class of Stochastic Languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: One-tape, off-line Turing machine computations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the structure of one-tape nondeterministic Turing machine time hierarchy / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A context-free language which is not acceptable by a probabilistic automaton / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An NP-complete language accepted in linear time by a one-tape Turing machine / rank | |||
Normal rank | |||
Latest revision as of 16:52, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA |
scientific article |
Statements
THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA (English)
0 references
19 January 2011
0 references
one-tape linear-time Turing machine
0 references
finite automaton
0 references
advice
0 references
randomized advice
0 references
pseudorandom
0 references
zero-sum game
0 references
