Pages that link to "Item:Q1566750"

The following pages link to Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs (Q1566750):

Displaying 33 items.

• On a structural property in the state complexity of projected regular languages (Q443744) (← links)
• Concatenation of regular languages and descriptional complexity (Q639851) (← links)
• The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract) (Q832942) (← links)
• A family of NFAs which need 2\(^{n}-\alpha\) deterministic states (Q1400001) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• More on the descriptional complexity of products of finite automata (Q2096585) (← links)
• State complexity of binary coded regular languages (Q2112182) (← links)
• The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract) (Q2117666) (← links)
• On the stabilization of nondeterministic finite automata via static output feedback (Q2284307) (← links)
• State complexity of combined operations (Q2383591) (← links)
• Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
• The Complexity of Languages Resulting from the Concatenation Operation (Q2829979) (← links)
• The magic number problem for subregular language families (Q2909186) (← links)
• Kleene closure and state complexity (Q2956884) (← 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 a Maximal NFA Without Mergible States (Q3434695) (← links)
• ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION (Q3503086) (← links)
• On the State Complexity of Complements, Stars, and Reversals of Regular Languages (Q3533030) (← 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)
• THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES (Q5168427) (← links)
• State Complexity of Projected Languages (Q5200092) (← links)
• Implementation and Application of Automata (Q5463991) (← links)
• Lower bound for converting an NFA with finite nondeterminism into an MDFA (Q5507074) (← links)
• MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS (Q5704381) (← links)
• The Ranges of Accepting State Complexities of Languages Resulting from Some Operations (Q5859667) (← links)
• The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case (Q6070753) (← links)
• State complexity of binary coded regular languages (Q6120344) (← links)
• Magic Numbers in Periodic Sequences (Q6134875) (← links)
• On the accepting state complexity of operations on permutation automata (Q6186540) (← links)