Quotient complexity of ideal languages
From MaRDI portal
Publication:1935811
DOI10.1016/j.tcs.2012.10.055zbMath1283.68190OpenAlexW2106875872MaRDI QIDQ1935811
Baiyu Li, Galina Jirásková, Janusz A. Brzozowski
Publication date: 19 February 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.055
Related Items (19)
Operations on Permutation Automata ⋮ Strongly connected synchronizing automata and the language of minimal reset words ⋮ The cut operation in subclasses of convex languages (extended abstract) ⋮ Nondeterministic complexity of operations on free and convex languages ⋮ Quotient complexity of closed languages ⋮ State complexity of pattern matching in regular languages ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ The cut operation in subclasses of convex languages ⋮ Operational complexity in subregular classes ⋮ Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages ⋮ Syntactic complexity of regular ideals ⋮ Power, positive closure, and quotients on convex languages ⋮ On the State Complexity of the Shuffle of Regular Languages ⋮ Nondeterministic Complexity of Operations on Closed and Ideal Languages ⋮ Nondeterministic complexity in subclasses of convex languages ⋮ Descriptional complexity of regular languages ⋮ Primitivity, uniform minimality, and state complexity of Boolean operations ⋮ Square on Ideal, Closed and Free Languages ⋮ Closure properties of subregular languages under operations
This page was built for publication: Quotient complexity of ideal languages
