Most complex regular ideal languages

zbMATH Open1401.68214arXiv1511.00157MaRDI QIDQ2965987FDOQ2965987

Authors: Sylvie Davies, Bo Liu, Janusz Brzozowski 

Publication date: 3 March 2017

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

Recommendations

• Most Complex Regular Right-Ideal Languages
• Quotient Complexity of Ideal Languages
• Quotient complexity of ideal languages
• Quotient complexities of atoms in regular ideal languages
• Syntactic complexity of regular ideals

zbMATH Keywords

quotientregular languageidealatomstate complexitysyntactic semigroupmost complexbasic operationsuniversal witness

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (12)

• Primitivity, uniform minimality, and state complexity of Boolean operations
• Complexity of proper prefix-convex regular languages
• Most complex non-returning regular languages
• In Search of Most Complex Regular Languages
• Regular ideal languages and their Boolean combinations
• Representations of regular ideals in finite automata
• Quotient complexities of atoms in regular ideal languages
• In search of most complex regular languages
• Complexity of left-ideal, suffix-closed and suffix-free regular languages
• Complexity of proper prefix-convex regular languages
• Most Complex Regular Right-Ideal Languages
• Complexity of suffix-free regular languages

This page was built for publication: Most complex regular ideal languages

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