Nondeterministic complexity of operations on free and convex languages
From MaRDI portal
Publication:2399254
DOI10.1007/978-3-319-60134-2_12zbMath1429.68117OpenAlexW2617501072MaRDI QIDQ2399254
Michal Hospodár, Galina Jirásková, Peter Mlynárčik
Publication date: 22 August 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-60134-2_12
Related Items (3)
A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity ⋮ Power, positive closure, and quotients on convex languages ⋮ Nondeterministic complexity in subclasses of convex languages
Cites Work
- Unnamed Item
- Intersection and union of regular languages and state complexity
- Quotient complexity of closed languages
- State complexity of some operations on binary regular languages
- Quotient complexity of ideal languages
- Nondeterministic Complexity of Operations on Closed and Ideal Languages
- COMPLEXITY IN UNION-FREE REGULAR LANGUAGES
- Complexity in Convex Languages
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language
- Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages
- Complement on Free and Ideal Languages
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
This page was built for publication: Nondeterministic complexity of operations on free and convex languages
