Complement on free and ideal languages
From MaRDI portal
Recommendations
- Nondeterministic complexity of operations on free and convex languages
- Nondeterministic complexity in subclasses of convex languages
- Complement on prefix-free, suffix-free, and non-returning NFA languages
- Nondeterministic state complexity for suffix-free regular languages
- Nondeterministic complexity of operations on closed and ideal languages
Cites work
- A lower bound technique for the size of nondeterministic finite automata
- Complement on prefix-free, suffix-free, and non-returning NFA languages
- Finite automata and unary languages
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 2050931 (Why is no real title available?)
- Nondeterminism and the size of two way finite automata
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Partial orders on words, minimal elements of regular languages, and state complexity
- State complexity of some operations on binary regular languages
Cited in
(9)- Power, positive closure, and quotients on convex languages
- Nondeterministic complexity in subclasses of convex languages
- Nondeterministic complexity of operations on free and convex languages
- Nondeterministic complexity of operations on closed and ideal languages
- Complement on prefix-free, suffix-free, and non-returning NFA languages
- Square on ideal, closed and free languages
- Star-complement-star on prefix-free languages
- Nondeterministic operational complexity in subregular languages
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity
This page was built for publication: Complement on free and ideal languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500692)
