A hardest language recognized by two-way nondeterministic pushdown automata (Q1158974): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:39, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hardest language recognized by two-way nondeterministic pushdown automata |
scientific article |
Statements
A hardest language recognized by two-way nondeterministic pushdown automata (English)
0 references
1981
0 references
language recognition
0 references
