In search of most complex regular languages
From MaRDI portal
Publication:5401550
Recommendations
Cites work
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- On the state complexity of reversals of regular languages
- State complexity of basic language operations combined with reversal
- State complexity of combined operations
- State complexity of combined operations with two basic operations
- State complexity of two combined operations: catenation-star and catenation-reversal
- State complexity of union and intersection of star on \(k\) regular languages
- The state complexities of some basic operations on regular languages
Cited in
(30)- In Search of Most Complex Regular Languages
- Large aperiodic semigroups
- Towards a theory of complexity of regular languages
- Most Complex Regular Right-Ideal Languages
- New tools for state complexity
- scientific article; zbMATH DE number 3843141 (Why is no real title available?)
- Kleene closure and state complexity
- Syntactic complexity of bifix-free languages
- Complexity of proper prefix-convex regular languages
- Primitivity, uniform minimality, and state complexity of Boolean operations
- Complexity of suffix-free regular languages
- Complexity of suffix-free regular languages
- On the interplay between Černý and Babai's conjectures
- Operational state complexity revisited: the contribution of monsters and modifiers
- State complexity of overlap assembly
- Unrestricted state complexity of binary operations on regular languages
- Prefix-free languages: left and right quotient and reversal
- Syntactic complexity of bifix-free regular languages
- scientific article; zbMATH DE number 7453083 (Why is no real title available?)
- Syntactic complexity of regular ideals
- Most complex non-returning regular languages
- Descriptional complexity of regular languages
- Complexity of bifix-free regular languages
- Complexity of bifix-free regular languages
- Complexity of proper prefix-convex regular languages
- Combination of roots and Boolean operations: an application to state complexity
- What is a complex regular language?
- State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures
- Complexity of left-ideal, suffix-closed and suffix-free regular languages
- State complexity of catenation combined with a Boolean operation: a unified approach
This page was built for publication: In search of most complex regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401550)
