Pages that link to "Item:Q2383591"

The following pages link to State complexity of combined operations (Q2383591):

Displaying 37 items.

• State complexity of star of union and square of union on \textit{k} regular languages (Q391180) (← links)
• State complexity of combined operations for suffix-free regular languages (Q392179) (← links)
• State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
• State complexity of combined operations with two basic operations (Q441851) (← links)
• State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
• State complexity of inversion operations (Q896671) (← links)
• On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
• State complexity of basic language operations combined with reversal (Q948089) (← links)
• State complexity of power (Q1019718) (← links)
• State complexity of unique rational operations (Q1019724) (← links)
• On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
• State-complexity hierarchies of uniform languages of alphabet-size length (Q2271458) (← links)
• Estimation of state complexity of combined operations (Q2271462) (← links)
• Primitivity, uniform minimality, and state complexity of Boolean operations (Q2322701) (← links)
• On the boundary of regular languages (Q2344745) (← links)
• State complexity of pattern matching in regular languages (Q2422023) (← links)
• Composition and orbits of language operations: finiteness and upper bounds (Q2855749) (← links)
• Undecidability of state complexity (Q2855756) (← links)
• State Complexity of Kleene-Star Operations on Trees (Q2891328) (← links)
• STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL (Q2909180) (← links)
• State Complexity of Regular Tree Languages for Tree Matching (Q2974061) (← links)
• State Complexity of Catenation Combined with Union and Intersection (Q3073626) (← links)
• Undecidability of State Complexities Using Mirror Images (Q3166954) (← links)
• STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION (Q3224949) (← links)
• State Complexity of Boundary of Prefix-Free Regular Languages (Q3455750) (← links)
• State complexity of cyclic shift (Q3515466) (← links)
• State Complexity of Combined Operations for Prefix-Free Regular Languages (Q3618598) (← links)
• STATE COMPLEXITY AND APPROXIMATION (Q4902894) (← links)
• (Q5020533) (← links)
• (Q5130744) (← links)
• State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal (Q5200089) (← links)
• State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
• State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach (Q5298308) (← links)
• Operational State Complexity of Subtree-Free Regular Tree Languages (Q5298309) (← links)
• IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES (Q5401550) (← links)
• Star-Complement-Star on Prefix-Free Languages (Q5500696) (← links)
• State complexity of deletion and bipolar deletion (Q5963404) (← links)