Most complex regular ideal languages
From MaRDI portal
Publication:2965987
Recommendations
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)