A simplified lower bound for context-free-language recognition
From MaRDI portal
Publication:3742752
DOI10.1016/S0019-9958(86)80048-1zbMath0605.68078MaRDI QIDQ3742752
Publication date: 1986
Published in: Information and Control (Search for Journal in Brave)
descriptional complexityword lengthon-line recognitionlinear context-free languagedeterministic multitape Turing machine
Related Items (1)
This page was built for publication: A simplified lower bound for context-free-language recognition