Two-way automata and length-preserving homomorphisms (Q4879206): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4101884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concatenation of inputs in a two-way automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-complexity of finite-state devices, state compressibility and incompressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial orders on words, minimal elements of regular languages, and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-realtime languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equations for regular languages, finite automata, and sequential networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite monoids and the fine structure of <i>NC</i> <sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3954784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation with a pebble / 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: Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of Turing machines with restricted tape alphabet size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the space complexity of some decision problems for finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of regular languages by Boolean automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of regular languages by Boolean automata. II / 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: An NP-complete language accepted in linear time by a one-tape Turing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds to Complexities of Networks for Sorting and for Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-size bounded alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halting space-bounded computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the pre-AFL of \([lg\;n]\) space and related families of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism and the size of two way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998976 / rank
 
Normal rank

Latest revision as of 12:23, 24 May 2024

scientific article; zbMATH DE number 881750
Language Label Description Also known as
English
Two-way automata and length-preserving homomorphisms
scientific article; zbMATH DE number 881750

    Statements

    Two-way automata and length-preserving homomorphisms (English)
    0 references
    0 references
    27 May 1996
    0 references
    0 references
    length-preserving homomorphisms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references