On reversal bounded alternating Turing machines (Q1102114): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(87)90138-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983106665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Acceptors and Intersections of Linear Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reduction of tape reversals for off-line one-tape Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Turn Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tape-reversal bounded Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on tape reversal complexity of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of reversal-bounded multipushdown machine languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707407 / rank
 
Normal rank

Latest revision as of 17:04, 18 June 2024

scientific article
Language Label Description Also known as
English
On reversal bounded alternating Turing machines
scientific article

    Statements

    On reversal bounded alternating Turing machines (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    space complexity
    0 references
    reversal complexity
    0 references
    alternating Turing machines
    0 references
    regular languages
    0 references
    0 references