Reversal-bounded nondeterministic multicounter machines and complementation (Q1094884): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:12, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reversal-bounded nondeterministic multicounter machines and complementation |
scientific article |
Statements
Reversal-bounded nondeterministic multicounter machines and complementation (English)
0 references
1987
0 references
It is proved, for any function \(f(n)=o(n)\) and any function \(\g(n)geq n\), that the family of languages recognized by one-way \(\g(n)\)-time bounded nondeterministic multicounter machines with \(f(n)\) counter reversals is not closed under complementation. Considering real-time and constant number of reversals this solves an open problem of \textit{K. Wagner} and \textit{G. Wechsung} [Computational complexity. Berlin: VEB Deutscher Verlag der Wissenschaften (1986; Zbl 0584.68062)].
0 references
nondeterminism
0 references
closure properties
0 references
reversal complexity
0 references
nondeterministic multicounter machines
0 references
