The power of two-way deterministic checking stack automata (Q1812540): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A general theory of translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of two-way deterministic classes of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138161 / 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: Q3857722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree transducers, L systems, and two-way machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stack Machines and Classes of Nonnested Macro Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended macro grammars and stack controlled machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking automata and one-way stack languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visits, crosses, and reversals for nondeterministic off-line machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: One way finite visit automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach to a Unified Theory of Automata / 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: Some characterizations of multihead finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707407 / rank
 
Normal rank

Latest revision as of 16:59, 14 May 2024

scientific article
Language Label Description Also known as
English
The power of two-way deterministic checking stack automata
scientific article

    Statements

    The power of two-way deterministic checking stack automata (English)
    0 references
    0 references
    25 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    checking stack automata
    0 references
    0 references