THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE (Q4032922): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Francine Blanchet-Sadri / rank | |||
| Property / author | |||
| Property / author: Francine Blanchet-Sadri / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:56, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE DOT-DEPTH OF A GENERATING CLASS OF APERIODIC MONOIDS IS COMPUTABLE |
scientific article |
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
