Pages that link to "Item:Q1763716"

The following pages link to State complexity of some operations on binary regular languages (Q1763716):

Displaying 39 items.

• State complexity of star of union and square of union on \textit{k} regular languages (Q391180) (← links)
• Size complexity of rotating and sweeping automata (Q414916) (← links)
• State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
• State complexity of the concatenation of regular tree languages (Q418803) (← links)
• State complexity of combined operations with two basic operations (Q441851) (← links)
• Nondeterministic state complexity of star-free languages (Q442152) (← links)
• Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
• Incomplete operational transition complexity of regular languages (Q498392) (← links)
• Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
• Concatenation of regular languages and descriptional complexity (Q639851) (← links)
• State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
• The state complexity of \(L^{2}\) and \(L^k\) (Q844206) (← links)
• Succinct description of regular languages by weak restarting automata (Q948085) (← links)
• On NFAs where all states are final, initial, or both (Q1034621) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• Combination of roots and Boolean operations: an application to state complexity (Q2105451) (← links)
• Operations on subregular languages and nondeterministic state complexity (Q2112186) (← links)
• Nondeterministic state complexity of nested word automata (Q2271435) (← links)
• Estimation of state complexity of combined operations (Q2271462) (← links)
• Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
• State complexity of combined operations (Q2383591) (← links)
• Nondeterministic complexity of operations on free and convex languages (Q2399254) (← links)
• Transition complexity of language operations (Q2465047) (← links)
• On complementing unambiguous automata and graphs with many cliques and cocliques (Q2671818) (← links)
• Operations on Unambiguous Finite Automata (Q2817392) (← links)
• Self-Verifying Finite Automata and Descriptional Complexity (Q2829967) (← links)
• Nondeterministic Complexity of Operations on Closed and Ideal Languages (Q2830213) (← links)
• Undecidability of state complexity (Q2855756) (← links)
• COMPLEXITY IN UNION-FREE REGULAR LANGUAGES (Q2909101) (← links)
• STATE COMPLEXITY OF CODE OPERATORS (Q2909103) (← links)
• STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL (Q2909180) (← links)
• State Complexity of Catenation Combined with Union and Intersection (Q3073626) (← links)
• STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION (Q3224949) (← links)
• Kernels of Sub-classes of Context-Free Languages (Q3297763) (← links)
• Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
• The complexity of concatenation on deterministic and alternating finite automata (Q5223613) (← links)
• Nondeterministic operational complexity in subregular languages (Q6093571) (← links)
• Iterative arrays with self-verifying communication cell (Q6195133) (← links)