A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers) (Q1097706)
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: A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers) |
scientific article; zbMATH DE number 4035190
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers) |
scientific article; zbMATH DE number 4035190 |
Statements
A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers) (English)
0 references
1987
0 references
Theorem 3.6 in \textit{K. Ayer}'s paper [ibid. 40, 163-174 (1985; Zbl 0603.68081)] is false. See also the author, \textit{A. Brandstädt} and \textit{K. W. Wagner} [Math. Syst. Theory 19, 277-299 (1987; Zbl 0633.68036)].
0 references
nondeterministic automata
0 references
pushdown automaton
0 references
ordered grammar
0 references
Deque automata
0 references
context-sensitive languages
0 references
0 references
0.92162657
0 references
0.83037305
0 references
0.82414526
0 references
0.8228897
0 references
0.8227299
0 references
0.8147223
0 references
0.80864865
0 references
