An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages
From MaRDI portal
Publication:1079015
DOI10.1016/0020-0190(86)90047-5zbMath0596.68045MaRDI QIDQ1079015
Publication date: 1986
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(86)90047-5
Related Items
Input-driven pushdown automata for edit distance neighborhood, Descriptional complexity of unambiguous input-driven pushdown automata, Optimal parallel parsing of bracket languages, Optimal parallel algorithms for dynamic expression evaluation and context-free recognition, Input-driven languages are linear conjunctive, Descriptional Complexity of Input-Driven Pushdown Automata
Cites Work