On the power of alternation in automata theory (Q1068537): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on blind and partially blind one-way multicounter machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: One way multihead deterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Pushdown and Stack Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating multihead finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i> + 1 Heads Are Better than <i>k</i> / rank
 
Normal rank

Latest revision as of 09:23, 17 June 2024

scientific article
Language Label Description Also known as
English
On the power of alternation in automata theory
scientific article

    Statements

    On the power of alternation in automata theory (English)
    0 references
    0 references
    1985
    0 references
    An extended abstract of this paper appeared in Lect. Notes Comput. Sci. 176, 322-329 (1984; Zbl 0571.68035).
    0 references
    one-way multicounter machines
    0 references
    blind counters
    0 references
    P
    0 references
    Turing machines
    0 references
    polynomial time
    0 references
    multihead finite automata
    0 references

    Identifiers