A polynomial-time parsing algorithm for \(K\)-depth languages

DOI10.1006/JCSS.1996.0006zbMath0846.68058OpenAlexW2012906089MaRDI 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

zbMATH Keywords

context-free grammars\(K\)-depth grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10) Grammars and rewriting systems (68Q42)

Related Items (2)

PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS ⋮ Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata

This page was built for publication: A polynomial-time parsing algorithm for \(K\)-depth languages