On generalized locally testable languages (Q760215): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:09, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On generalized locally testable languages |
scientific article |
Statements
On generalized locally testable languages (English)
0 references
1984
0 references
This paper discusses a family of star-free languages, over a two letter alphabet, which generalizes both the locally testable languages and the \({\mathcal G}\)-trivial languages. Characterizations are given in terms of congruences, monoids, and semiautomata.
0 references
regular languages
0 references
star-free languages
0 references
congruences
0 references
monoids
0 references
semiautomata
0 references
