On generalized locally testable languages (Q760215)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3883636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On generalized locally testable languages |
scientific article; zbMATH DE number 3883636 |
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
0.9439322
0 references
0.92882115
0 references
0.92882115
0 references
0 references
0.9264258
0 references
0.91343236
0 references
0.9084854
0 references
0.90605754
0 references
