A hardest language recognized by two-way nondeterministic pushdown automata
From MaRDI portal
Publication:1158974
DOI10.1016/0020-0190(81)90045-4zbMath0474.68089OpenAlexW2034634077MaRDI QIDQ1158974
Publication date: 1981
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(81)90045-4
Related Items
Language recognition by two-way deterministic pushdown automata, Remarks on multihead pushdown automata and multihead stack automata
Cites Work