Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages (Q3014933): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: First-order definability on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular languages in \(NC\) / 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: Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4453869 / 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: A logic for constant-depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages that Capture Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing \(\text{TC}^{0}\) in terms of infinite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on<i>C</i>-varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic and topological theory of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kernel of monoid morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144209 / 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: Q4302435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Meets Algebra: the Case of Regular Languages / rank
 
Normal rank

Latest revision as of 06:59, 4 July 2024

scientific article
Language Label Description Also known as
English
Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages
scientific article

    Statements

    Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages (English)
    0 references
    0 references
    0 references
    8 July 2011
    0 references
    0 references
    0 references