Varieties of Formal Languages¶
Pin, J. (1986). Varieties of Formal Languages. Plenum Press.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Monoid
- The classification results are sharp: a language is regular exactly when its syntactic monoid is finite, and star-free exactly when that monoid is aperiodic.
This sourceDevelops the free monoid, the syntactic monoid as a quotient by the syntactic congruence, regularity as finiteness of that monoid, and Schutzenberger's characterisation of star-free languages by aperiodicity.
- The classification results are sharp: a language is regular exactly when its syntactic monoid is finite, and star-free exactly when that monoid is aperiodic.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:e98c523b25b8 · see in the full table