Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages
From MaRDI portal
Publication:2938126
DOI10.1007/978-3-319-04298-5_45zbMath1432.68250arXiv1303.1717OpenAlexW2963195214MaRDI QIDQ2938126
Publication date: 13 January 2015
Published in: SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.1717
context-free languageregular languageTuring reducibilitypolynomial hierarchyoraclemany-one reducibilitypushdown automatonDyck languageCFL hierarchy
Related Items