THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS (Q4711250)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS |
scientific article; zbMATH DE number 2040
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS |
scientific article; zbMATH DE number 2040 |
Statements
THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS (English)
0 references
25 June 1992
0 references
monoid
0 references
regular sets
0 references
code
0 references
finite automata
0 references
completeness
0 references
reducibility
0 references
Turing machine
0 references
0.8802648
0 references
0.87371653
0 references
0.8711202
0 references
0 references
0.87030107
0 references
