\(NC^ 1\): The automata-theoretic viewpoint (Q685708): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-uniform automata over groups / 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: Bounds for Width Two Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of locally testable events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages of R-trivial monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dot-depth hierarchy of star-free languages is infinite / 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: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized Polynomial Time Hierarchies Having Exactly <i>K</i> Levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse semigroups and varieties of finite semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic decision procedures for local testability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation with threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le produit avec compteur modulo un nombre premier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally trivial categories and unambiguous concatenation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite monoids having only trivial subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONSTANT-DEPTH PERIODIC CIRCUITS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of finite monoids: the language approach / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:55, 22 May 2024

scientific article
Language Label Description Also known as
English
\(NC^ 1\): The automata-theoretic viewpoint
scientific article

    Statements

    \(NC^ 1\): The automata-theoretic viewpoint (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    automata
    0 references
    monoids
    0 references
    variety
    0 references
    circuit
    0 references