Notes on congruence relations and factor pumping conditions for rational languages (Q1110344)
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 4072415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Notes on congruence relations and factor pumping conditions for rational languages |
scientific article; zbMATH DE number 4072415 |
Statements
Notes on congruence relations and factor pumping conditions for rational languages (English)
0 references
1988
0 references
If \(\Sigma\) * is the free semigroup over an alphabet \(\Sigma\), \(L\subseteq \Sigma *\), and \(\sim\) is a congruence on \(\Sigma\) *, then L/\(\sim\) is the set of congruence classes of words in L. The author considers conditions for L/\(\sim\) to be finite, a finite semigroup, or a finite group. Pumping conditions which are equivalent to rationality are also considered for these factors.
0 references
idempotent
0 references
periodic
0 references
free semigroup
0 references
alphabet
0 references
congruence
0 references
finite semigroup
0 references
finite group
0 references
Pumping conditions
0 references
0.7335833311080933
0 references
0.7222532033920288
0 references
0.7189215421676636
0 references
