A polynomial-time parsing algorithm for \(K\)-depth languages
From MaRDI portal
Publication:1915505
DOI10.1006/jcss.1996.0006zbMath0846.68058MaRDI QIDQ1915505
Pierluigi San Pietro, A. Cherubini Spoletini
Publication date: 16 July 1996
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1996.0006
68Q45: Formal languages and automata
68W10: Parallel algorithms in computer science
68Q42: Grammars and rewriting systems
Related Items
PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS, Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata