Hierarchies of one-way multihead automata languages (Q1099645): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Variations on the technique of Ďuriš and Galil / 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: Fooling a two way automaton or one pushdown store is better than one counter for two way machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way simple multihead finite automata are not closed under concatenation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space bounds for processing contentless inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Regular Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Algol-Like Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infinite Hierarchy of Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-tape and multi-head pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-determinacy in simple computing devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tape bounds for single letter alphabet language processing / 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: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3925894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One way multihead deterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on semilinear sets and bounded-reversal multihead pushdown 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: On two-way multihead automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A useful device for showing the solvability of some decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-head versus 2-head finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way simple multihead finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy theorem for multihead stack-counter automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on multihead pushdown automata and multihead stack automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The LBA-problem and the deterministic tape complexity of two-way one- counter languages over a one-letter alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformational methods and their application to complexity problems. Corrigenda / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line simulation of k + 1 tapes by k tapes requires nonlinear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5559262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multitape one-way nonwriting automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Head Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating refined space complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for separating space complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way multihead writing finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146255 / 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 15:19, 18 June 2024

scientific article
Language Label Description Also known as
English
Hierarchies of one-way multihead automata languages
scientific article

    Statements

    Hierarchies of one-way multihead automata languages (English)
    0 references
    0 references
    1986
    0 references
    one-way multihead automata languages
    0 references
    pushdown automta
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers