On partially blind multihead finite automata. (Q2490819): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Bala Ravikumar / rank
Normal rank
 
Property / author
 
Property / author: Bala Ravikumar / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057070067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a complexity hierarchy between L and NL / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on the complexity of nondeterministic counter languages / 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: Multi-tape and multi-head pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / 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: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problems for NL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages / rank
 
Normal rank

Latest revision as of 14:20, 24 June 2024

scientific article
Language Label Description Also known as
English
On partially blind multihead finite automata.
scientific article

    Statements

    On partially blind multihead finite automata. (English)
    0 references
    0 references
    0 references
    18 May 2006
    0 references
    0 references
    blind head
    0 references
    finite automaton
    0 references
    probabilistic automaton
    0 references
    counter machine
    0 references
    semilinear language
    0 references
    0 references