Alternating real-time computations (Q1111386): 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.1016/0020-0190(88)90179-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073116366 / rank | |||
Normal rank | |||
Revision as of 00:23, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Alternating real-time computations |
scientific article |
Statements
Alternating real-time computations (English)
0 references
1988
0 references
The effect of the number of work tapes on computational power of real- time Turing machines is considered. Well known results state that k tapes are better than k-1 tapes in the case of deterministic machines and, for nondeterministic ones, two tapes are as good as many tapes. We show that alternating real-time pushdown automata recognize the same class of languages as multitape alternating machines working in linear time. It is also shown that the automata making a constant number of alternations and only one reversal recognize exactly rudimentary languages.
0 references
alternating Turing machine
0 references
real-time computation
0 references
pushdown automata
0 references
rudimentary languages
0 references
