Boolean kernels of context-free languages

DOI10.1007/978-3-030-79121-6_13OpenAlexW3176181374MaRDI QIDQ2117675

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient recognizer for the Boolean closure of context-free languages
• The Boolean closure of linear context-free languages
• Degree-languages: A new concept of acceptance
• Nondeterminism and Boolean operations in pda's
• On strongly context-free languages
• Boolean grammars
• Finite turns and the regular closure of linear context-free languages
• Kernels of Sub-classes of Context-Free Languages
• Regular Closure of Deterministic Languages
• Self-Verifying Pushdown and Queue Automata

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