Pages that link to "Item:Q1935811"
From MaRDI portal
The following pages link to Quotient complexity of ideal languages (Q1935811):
Displaying 23 items.
- Syntactic complexity of regular ideals (Q722210) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- The computational complexity of ideal semantics (Q1045987) (← links)
- Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
- Quotient complexity of closed languages (Q1678754) (← links)
- Power, positive closure, and quotients on convex languages (Q2029485) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Closure properties of subregular languages under operations (Q2104140) (← links)
- The cut operation in subclasses of convex languages (extended abstract) (Q2164745) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- Primitivity, uniform minimality, and state complexity of Boolean operations (Q2322701) (← links)
- Nondeterministic complexity of operations on free and convex languages (Q2399254) (← links)
- State complexity of pattern matching in regular languages (Q2422023) (← links)
- Quotient complexities of atoms in regular ideal languages (Q2803047) (← links)
- On the State Complexity of the Shuffle of Regular Languages (Q2829972) (← links)
- Nondeterministic Complexity of Operations on Closed and Ideal Languages (Q2830213) (← links)
- Quotient Complexity of Ideal Languages (Q3557022) (← links)
- Middle quotients of linear languages (Q4254654) (← links)
- QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES (Q4923279) (← links)
- Operations on Permutation Automata (Q5041254) (← links)
- Square on Ideal, Closed and Free Languages (Q5500682) (← links)
- Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages (Q5738995) (← links)
- The cut operation in subclasses of convex languages (Q6165559) (← links)
