Quotient complexity of regular languages

MaRDI QIDQ5146512zbMATH OpenFDO

Authors Janusz Brzozowski

Publication date 26 January 2021

Full work available at URL http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCFS2009.2

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

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

Cited in

(13)

• QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
• On quotients of formal power series
• Towards a theory of complexity of regular languages
• Language operations with regular expressions of polynomial size
• Distinguishability operations and closures
• Symmetric groups and quotient complexity of Boolean operations
• On the computation of quotients and factors of regular languages
• Further Remarks on the Operational Nonterminal Complexity
• Quotient complexity of ideal languages
• Quotient Complexity of Ideal Languages
• Quotient complexity of star-free languages
• The full quotient and its closure property for regular languages
• Middle quotients of linear languages

This page was built for publication: Quotient complexity of regular languages

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