Non-regular Maximal Prefix-Free Subsets of Regular Languages

DOI10.1007/978-3-662-53132-7_19MaRDI QIDQ2817391zbMATH OpenOpenAlexFDO

Authors Jozef jun. Jirásek

Publication date 30 August 2016

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53132-7_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Prefix-free subsets of regular languages and descriptional complexity
• scientific article; zbMATH DE number 7315105
• An optimal lower bound for nonregular languages
• Prefix-free regular languages and pattern matching
• On the degree of non-regularity of context-free languages
• Developments in Language Theory
• A pumping lemma for regular closure of prefix-free languages
• On approximating non-regular languages by regular languages
• On a subclass of \(\infty\)-regular languages

Cites work

• Cyclic shift on prefix-free languages
• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• On universal computably enumerable prefix codes
• Prefix-free subsets of regular languages and descriptional complexity
• Star-complement-star on prefix-free languages
• State Complexity of Combined Operations for Prefix-Free Regular Languages

Cited in

(3)

• Prefix-free regular languages and pattern matching
• Theoretical Aspects of Computing – ICTAC 2005
• Prefix-free subsets of regular languages and descriptional complexity

This page was built for publication: Non-regular Maximal Prefix-Free Subsets of Regular Languages

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