Boolean kernels of context-free languages

DOI10.1007/978-3-030-79121-6_13MaRDI QIDQ2117675zbMATH OpenOpenAlexFDO

Authors Martin Kutrib, Luca Prigioniero

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-79121-6_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3426894 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3640909 (Why is no real title available?)
• An efficient recognizer for the Boolean closure of context-free languages
• Boolean grammars
• Degree-languages: A new concept of acceptance
• Descriptional complexity -- an introductory survey
• Finite turns and the regular closure of linear context-free languages
• Kernels of sub-classes of context-free languages
• Nondeterminism and Boolean operations in pda's
• On strongly context-free languages
• Regular Closure of Deterministic Languages
• Self-verifying pushdown and queue automata
• The Boolean closure of linear context-free languages

Cited in

(4)

• Expressive Power of LL(k) Boolean Grammars
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• scientific article; zbMATH DE number 139804 (Why is no real title available?)
• The Boolean closure of linear context-free languages

This page was built for publication: Boolean kernels of context-free languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117675)