Extensions of an idea of McNaughton (Q3489464)
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: Publication:3489464 |
scientific article; zbMATH DE number 4162277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extensions of an idea of McNaughton |
scientific article; zbMATH DE number 4162277 |
Statements
Extensions of an idea of McNaughton (English)
0 references
1990
0 references
combinatorial complexity
0 references
first order
0 references
star free
0 references
computational complexity of a regular language
0 references
boolean circuit complexity
0 references
0 references
0.8035900592803955
0 references
0.7929722666740417
0 references