TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538)
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 5346925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE |
scientific article; zbMATH DE number 5346925 |
Statements
TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (English)
0 references
25 September 2008
0 references
computational lower bounds
0 references
regular languages
0 references
0 references
0 references
0 references
0.8966943621635437
0 references
0.8321018815040588
0 references
0.7935971617698669
0 references
