Quotient complexity of star-free languages

MaRDI QIDQ5740417zbMATH OpenFDO

Authors Bo Liu, Janusz Brzozowski

Publication date 26 July 2016

Full work available at URL https://arxiv.org/abs/1012.3962

zbMATH Keywords

aperiodic automatonquotient complexityregular languagesstar-free languagesstate complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
• Quotient complexity of regular languages
• Quotient complexity of bifix-, factor-, and subword-free regular languages
• Quotient complexity of bifix-, factor-, and subword-free regular languages
• Towards a theory of complexity of regular languages

Cited in

(11)

• A characterization of rational star languages generated by strong codes
• The exact complexity of star-complement-star
• Quotient complexity of ideal languages
• Quotient Complexity of Ideal Languages
• Quotient and bounded context-free languages
• Nondeterministic state complexity of star-free languages
• QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
• Quotient complexity of regular languages
• Symmetric groups and quotient complexity of Boolean operations
• Quotient complexity of bifix-, factor-, and subword-free regular languages
• Quotient complexity of bifix-, factor-, and subword-free regular languages

This page was built for publication: Quotient complexity of star-free languages

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