Circuit complexity of regular languages (Q5895106): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4848740 / 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: Regular languages in \(NC\) / 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: Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded fan-in circuits and associative functions / 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: Q4228451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication in bounded depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-size constant-depth polylog-threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of recognizable sets corresponding to certain varieties of finite monoids / 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: Q4407441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete classifications for the communication complexity of regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of finite monoids: the language approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393484 / rank
 
Normal rank

Latest revision as of 01:20, 2 July 2024

scientific article; zbMATH DE number 5617723
Language Label Description Also known as
English
Circuit complexity of regular languages
scientific article; zbMATH DE number 5617723

    Statements

    Circuit complexity of regular languages (English)
    0 references
    0 references
    19 October 2009
    0 references
    regular languages
    0 references
    circuit complexity
    0 references
    upper and lower bounds
    0 references

    Identifiers