Dissecting power of intersection of two context-free languages

DOI10.46298/DMTCS.9063MaRDI QIDQ6599793

Josef Rukavicka

Publication date: 6 September 2024

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

zbMATH Keywords

context-free languagesdissecting of infinite languagesintersection of context-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Intersection and union hierarchies of deterministic context-free languages and pumping lemmas
• Dissecting power of certain matrix languages
• The dissecting power of regular languages
• Deterministic context free languages
• An infinite hierarchy of intersections of context-free languages
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: Dissecting power of intersection of two context-free languages

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