Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages (Q2938126): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:15, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages |
scientific article |
Statements
Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages (English)
0 references
13 January 2015
0 references
regular language
0 references
context-free language
0 references
pushdown automaton
0 references
oracle
0 references
many-one reducibility
0 references
Turing reducibility
0 references
CFL hierarchy
0 references
polynomial hierarchy
0 references
Dyck language
0 references
