Piecewise testable languages via combinatorics on words (Q641179): 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: A proof of Simon's theorem on 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: Q4714446 / 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: Partially ordered finite monoids and a theorem of I. Simon / rank | |||
Normal rank |
Latest revision as of 13:10, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Piecewise testable languages via combinatorics on words |
scientific article |
Statements
Piecewise testable languages via combinatorics on words (English)
0 references
21 October 2011
0 references
piecewise testable languages
0 references
syntactic congruence
0 references
0 references