Pages that link to "Item:Q688156"

The following pages link to Partial orders on words, minimal elements of regular languages, and state complexity (Q688156):

Displaying 50 items.

• Unambiguous finite automata over a unary alphabet (Q418147) (← links)
• On the state complexity of operations on two-way finite automata (Q515574) (← links)
• Concatenation of regular languages and descriptional complexity (Q639851) (← links)
• On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
• Succinct description of regular languages by weak restarting automata (Q948085) (← links)
• Decimations of languages and state complexity (Q1019721) (← links)
• On NFAs where all states are final, initial, or both (Q1034621) (← links)
• Intersection and union of regular languages and state complexity (Q1199879) (← links)
• The size of power automata. (Q1401251) (← links)
• An extension of a Y. C. Yang theorem (Q1701728) (← 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)
• Complementing unary nondeterministic automata (Q1763723) (← links)
• The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• State complexity of union and intersection on graph-walking automata (Q2096590) (← links)
• On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
• Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
• State complexity of unambiguous operations on finite automata (Q2334604) (← links)
• State complexity of combined operations (Q2383591) (← links)
• State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
• The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic (Q2423779) (← links)
• On complementing unambiguous automata and graphs with many cliques and cocliques (Q2671818) (← links)
• Improved complement for two-way alternating automata (Q2675811) (← 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)
• COMPLEXITY IN UNION-FREE REGULAR LANGUAGES (Q2909101) (← links)
• MAGIC NUMBERS AND TERNARY ALPHABET (Q3086242) (← links)
• Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
• Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
• Deterministic blow-ups of minimal NFA's (Q3421910) (← links)
• ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION (Q3503086) (← links)
• State complexity of cyclic shift (Q3515466) (← links)
• On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
• On the State Complexity of Complements, Stars, and Reversals of Regular Languages (Q3533030) (← links)
• On the State Complexity of Operations on Two-Way Finite Automata (Q3533031) (← links)
• DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET (Q3538853) (← links)
• Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
• Magic Numbers and Ternary Alphabet (Q3637234) (← links)
• Operations on Unambiguous Finite Automata (Q4683235) (← links)
• Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
• A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (Q5002825) (← links)
• THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES (Q5168427) (← links)
• State-complexity of finite-state devices, state compressibility and incompressibility (Q5289271) (← links)
• STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION (Q5462121) (← links)
• BÜCHI COMPLEMENTATION MADE TIGHTER (Q5484906) (← links)
• Complement on Free and Ideal Languages (Q5500692) (← links)
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES (Q5696955) (← links)