On the computational complexity of P automata (Q876857): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11047-005-4461-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094727449 / rank | |||
Normal rank | |||
Revision as of 21:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of P automata |
scientific article |
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
