Nondeterministic Complexity of Operations on Closed and Ideal Languages
From MaRDI portal
Publication:2830213
DOI10.1007/978-3-319-40946-7_11zbMath1475.68155MaRDI QIDQ2830213
Galina Jirásková, Michal Hospodár, Peter Mlynárčik
Publication date: 9 November 2016
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-40946-7_11
68Q45: Formal languages and automata
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A lower bound technique for the size of nondeterministic finite automata
- Partial orders on words, minimal elements 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
- COMPLEXITY IN UNION-FREE REGULAR LANGUAGES
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages
- Square on Ideal, Closed and Free Languages
- Complement on Free and Ideal Languages
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES