Note on dissecting power of regular languages

DOI10.1007/978-3-031-97548-6_20MaRDI QIDQ6899357zbMATH OpenFDO

Authors Josef Rukavicka

Publication date 14 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-97548-6_20

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites work

• Automata, languages and programming. 2nd colloquium, University of Saarbrücken, July 29-August 2, 1974
• Dissecting power of certain matrix languages
• Dissecting power of intersection of two context-free languages
• scientific article; zbMATH DE number 2087235 (Why is no real title available?)
• Intersection and union hierarchies of deterministic context-free languages and pumping lemmas
• Recursively enumerable sets of positive integers and their decision problems
• The dissecting power of regular languages

This page was built for publication: Note on dissecting power of regular languages

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