Complement on Free and Ideal Languages

DOI10.1007/978-3-319-19225-3_16zbMath1432.68234OpenAlexW1066635501MaRDI QIDQ5500692

Peter Mlynárčik

Publication date: 7 August 2015

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19225-3_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Nondeterministic complexity of operations on free and convex languages ⋮ Nondeterministic operational complexity in subregular languages ⋮ A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity ⋮ Power, positive closure, and quotients on convex languages ⋮ Nondeterministic Complexity of Operations on Closed and Ideal Languages ⋮ Nondeterministic complexity in subclasses of convex languages

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
• Finite automata and unary languages
• State complexity of some operations on binary regular languages
• Nondeterminism and the size of two way finite automata
• Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES

This page was built for publication: Complement on Free and Ideal Languages