On the computational complexity of P automata (Q876857)
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: On the computational complexity of P automata |
scientific article; zbMATH DE number 5144826
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of P automata |
scientific article; zbMATH DE number 5144826 |
Statements
On the computational complexity of P automata (English)
0 references
19 April 2007
0 references
accepting systems
0 references
communicating systems
0 references
automata
0 references
context-sensitive languages
0 references
sub-logarithmic space complexity
0 references
0 references
0.92585063
0 references
0 references
0.9073668
0 references
0 references
0.90519863
0 references
0.9038242
0 references
0.9038242
0 references
