Pages that link to "Item:Q1318694"

The following pages link to The state complexities of some basic operations on regular languages (Q1318694):

Displaying 50 items.

• Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
• 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)
• Unambiguous finite automata over a unary alphabet (Q418147) (← 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)
• A finite state intersection approach to propositional satisfiability (Q442157) (← links)
• The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731) (← links)
• Reversal of binary regular languages (Q443743) (← links)
• State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
• Incomplete operational transition complexity of regular languages (Q498392) (← links)
• On the state complexity of operations on two-way finite automata (Q515574) (← links)
• Two double-exponential gaps for automata with a limited pushdown (Q515677) (← links)
• On the state complexity of reversals of regular languages (Q596099) (← links)
• Concatenation of regular languages and descriptional complexity (Q639851) (← links)
• Acyclic networks maximizing the printing complexity (Q703493) (← links)
• State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
• State complexity of projection on languages recognized by permutation automata and commuting letters (Q832938) (← links)
• The state complexity of \(L^{2}\) and \(L^k\) (Q844206) (← links)
• An approximation algorithm for state minimization in 2-MDFAs (Q855011) (← links)
• State complexity of inversion operations (Q896671) (← links)
• Prefix-free languages: left and right quotient and reversal (Q896681) (← links)
• Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
• State complexity of basic language operations combined with reversal (Q948089) (← links)
• Enumeration and random generation of accessible automata (Q995562) (← links)
• State complexity of power (Q1019718) (← links)
• State complexity of unique rational operations (Q1019724) (← links)
• State complexity of basic operations on suffix-free regular languages (Q1029324) (← links)
• Succinctness of descriptions of SBTA-languages (Q1391741) (← links)
• Quotient complexity of closed languages (Q1678754) (← links)
• On the gap between separating words and separating their reversals (Q1698731) (← links)
• On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
• On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) (← links)
• State complexity of some operations on binary regular languages (Q1763716) (← links)
• Simulating finite automata with context-free grammars. (Q1853167) (← links)
• State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata (Q2003500) (← links)
• Some properties of iterated languages (Q2011823) (← links)
• Power, positive closure, and quotients on convex languages (Q2029485) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• Commutative regular languages with product-form minimal automata (Q2096583) (← links)
• State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages (Q2096584) (← links)
• On Simon's congruence closure of a string (Q2112187) (← links)
• State complexity of GF(2)-operations on unary languages (Q2113387) (← links)
• State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
• Performing regular operations with 1-limited automata (Q2164004) (← links)
• Operational complexity and pumping lemmas (Q2170280) (← links)
• State-complexity hierarchies of uniform languages of alphabet-size length (Q2271458) (← links)
• Estimation of state complexity of combined operations (Q2271462) (← links)
• Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)