An efficient recognizer for the Boolean closure of context-free languages
From MaRDI portal
Publication:802880
DOI10.1016/0304-3975(91)90205-GzbMath0726.68052MaRDI QIDQ802880
Lothar Schmitz, Stephan Heilbrunner
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)
Related Items
Conjunctive and Boolean grammars: the true general case of the context-free grammars, The Boolean closure of linear context-free languages, Boolean kernels of context-free languages
Cites Work