A non-ambiguous decomposition of regular languages and factorizing codes (Q1861571)
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 1878531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A non-ambiguous decomposition of regular languages and factorizing codes |
scientific article; zbMATH DE number 1878531 |
Statements
A non-ambiguous decomposition of regular languages and factorizing codes (English)
0 references
9 March 2003
0 references
formal languages
0 references
non-ambiguous factorizations
0 references
codes
0 references
Schützenberger's factorization conjecture
0 references
0.8886895
0 references
0.8788438
0 references
0 references
0.8663192
0 references
0.86610854
0 references
0 references
0.8641323
0 references
0.8616437
0 references
0.8616259
0 references
