(Semi)alternating stack automata (Q3959454): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stack automata and compiling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Systems: Constructions, Solutions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonerasing stack automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Pushdown and Stack Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank

Latest revision as of 16:00, 13 June 2024

scientific article
Language Label Description Also known as
English
(Semi)alternating stack automata
scientific article

    Statements

    (Semi)alternating stack automata (English)
    0 references
    0 references
    0 references
    1982
    0 references
    space complexity of languages accepted by stack automata
    0 references
    alternating stack automata
    0 references
    alternating pushdown automata
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references