Boolean kernels of context-free languages

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

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

• Nondeterminism and Boolean operations in pda's
• Title not available (Why is that?)
• Boolean grammars
• An efficient recognizer for the Boolean closure of context-free languages
• Descriptional complexity -- an introductory survey
• Title not available (Why is that?)
• The Boolean closure of linear context-free languages
• On strongly context-free languages
• Regular Closure of Deterministic Languages
• Finite turns and the regular closure of linear context-free languages
• Degree-languages: A new concept of acceptance
• Title not available (Why is that?)
• Kernels of Sub-classes of Context-Free Languages
• Self-Verifying Pushdown and Queue Automata

Cited In (4)

• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• Title not available (Why is that?)
• Expressive Power of LL(k) Boolean Grammars
• 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)