Recognizable languages and congruences (Q1172156): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Languages of R-trivial monoids / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The dot-depth hierarchy of star-free languages is infinite / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4132170 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Families of recognizable sets corresponding to certain varieties of finite monoids / rank | |||
Normal rank | |||
Revision as of 17:34, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizable languages and congruences |
scientific article |
Statements
Recognizable languages and congruences (English)
0 references
1981
0 references
congruences
0 references
varieties of finite monoids
0 references
recognizable languages
0 references
