Pages that link to "Item:Q1400001"

The following pages link to A family of NFAs which need 2\(^{n}-\alpha\) deterministic states (Q1400001):

Displayed 19 items.

• On a structural property in the state complexity of projected regular languages (Q443744) ‎ (← links)
• Concatenation of regular languages and descriptional complexity (Q639851) ‎ (← links)
• Descriptional complexity of regular languages (Q2074214) ‎ (← 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)
• MAGIC NUMBERS AND TERNARY ALPHABET (Q3086242) ‎ (← 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)
• State complexity of cyclic shift (Q3515466) ‎ (← 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)
• MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS (Q5704381) ‎ (← links)
• Magic Numbers in Periodic Sequences (Q6134875) ‎ (← links)