Parsing Boolean grammars over a one-letter alphabet using online convolution
From MaRDI portal
Publication:714852
DOI10.1016/j.tcs.2012.06.032zbMath1253.68200MaRDI QIDQ714852
Alexander Okhotin, Christian Reitwießner
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.032
context-free grammars; parsing; unary languages; integer multiplication; Boolean grammars; conjunctive grammars; Boolean convolution
Uses Software