One-Counter Verifiers for Decidable Languages
From MaRDI portal
Publication:4928501
DOI10.1007/978-3-642-38536-0_32zbMath1382.68138arXiv1207.3880OpenAlexW2963588035MaRDI QIDQ4928501
Publication date: 14 June 2013
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.3880
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
On regular realizability problems for context-free languages ⋮ Unnamed Item ⋮ Classical and Quantum Counter Automata on Promise Problems ⋮ New Results on the Minimum Amount of Useful Space ⋮ Regular Realizability Problems and Context-Free Languages
This page was built for publication: One-Counter Verifiers for Decidable Languages
