Operations on subregular languages and nondeterministic state complexity

DOI10.1007/978-3-031-13257-5_9OpenAlexW4300103778MaRDI QIDQ2112186

Michal Hospodár, Peter Mlynárčik, Viktor Olejár

Publication date: 18 January 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-13257-5_9

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Nondeterministic operational complexity in subregular languages ⋮ Operational complexity in subregular classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nondeterministic state complexity of star-free languages
• State complexity of power
• Intersection and union of regular languages and state complexity
• State complexity of some operations on binary regular languages
• Power, positive closure, and quotients on convex languages
• State complexity bounds for the commutative closure of group languages
• Determination of finite automata accepting subregular languages
• Nondeterministic complexity in subclasses of convex languages
• COMPLEXITY IN UNION-FREE REGULAR LANGUAGES
• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• Power-separating regular languages
• On finite monoids having only trivial subgroups
• Roots of Star Events
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES

This page was built for publication: Operations on subregular languages and nondeterministic state complexity