Alternating multicounter machines with constant number of reversals (Q1067412)
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 3928352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Alternating multicounter machines with constant number of reversals |
scientific article; zbMATH DE number 3928352 |
Statements
Alternating multicounter machines with constant number of reversals (English)
0 references
1985
0 references
The alternating multicounter machines with constant number of reversals are investigated in relation to Turing machines. It is shown that two-way and one-way versions of these machines working in polynomial time define precisely the class P of languages recognized by Turing machines in deterministic polynomial time. Further, it is proved that one-way alternating 4-counter machines with one reversal allowed for each counter are as powerful as Turing machines.
0 references
alternation
0 references
multihead automata
0 references
Turing machines
0 references
polynomial time
0 references
0.8649012446403503
0 references
0.8428232073783875
0 references
0.839713454246521
0 references
