Hierarchies of Piecewise Testable Languages (Q3533034): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games, equations and the dot-depth hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equations and monoid varieties of dot-depth one and two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4439449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Simon's theorem on piecewise testable languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On varieties of meet automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of Piecewise Testable Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3123631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eilenberg's theorem for positive varieties of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial closure and unambiguous product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3435485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of some classes of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite \(\mathcal J\)-trivial monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially ordered finite monoids and a theorem of I. Simon / rank
 
Normal rank
Property / cites work
 
Property / cites work: REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT / rank
 
Normal rank

Latest revision as of 19:24, 28 June 2024

scientific article
Language Label Description Also known as
English
Hierarchies of Piecewise Testable Languages
scientific article

    Statements

    Hierarchies of Piecewise Testable Languages (English)
    0 references
    0 references
    0 references
    30 October 2008
    0 references
    0 references
    varieties of languages
    0 references
    piecewise testable languages
    0 references
    syntactic monoid
    0 references
    0 references