HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES (Q3586402): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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: 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: 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: 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: 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 04:32, 3 July 2024

scientific article
Language Label Description Also known as
English
HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES
scientific article

    Statements