THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE (Q4032922)
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 165000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE |
scientific article; zbMATH DE number 165000 |
Statements
THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE (English)
0 references
16 May 1993
0 references
regular language
0 references
syntactic monoid
0 references
dot-depth hierarchy
0 references
star-free languages
0 references
varieties of finite monoids
0 references
semantic games
0 references
0.849122941493988
0 references
0.8468119502067566
0 references
0.8432661890983582
0 references
0.8285605311393738
0 references
