Kernels of Sub-classes of Context-Free Languages

DOI10.1007/978-3-030-38919-2_12zbMath1440.68159OpenAlexW3000512384MaRDI QIDQ3297763

Martin Kutrib

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-38919-2_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Boolean kernels of context-free languages

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• State complexity of some operations on binary regular languages
• Finite turns and the regular closure of linear context-free languages
• Regular Closure of Deterministic Languages
• Bounded Algol-Like Languages
• Finite-Turn Pushdown Automata
• The Unsolvability of the Recognition of Linear Context-Free Languages
• On Context-Free Languages

This page was built for publication: Kernels of Sub-classes of Context-Free Languages