Pages that link to "Item:Q5696955"
From MaRDI portal
The following pages link to NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES (Q5696955):
Displaying 28 items.
- State complexity of cyclic shift (Q3515466) (← 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)
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES (Q3538851) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← links)
- State Complexity of Combined Operations for Prefix-Free Regular Languages (Q3618598) (← links)
- (Q3785993) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- STATE COMPLEXITY AND APPROXIMATION (Q4902894) (← links)
- THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES (Q5168427) (← links)
- NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS (Q5173288) (← links)
- Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
- The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata (Q5200083) (← links)
- State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet (Q5200094) (← links)
- State Trade-Offs in Unranked Tree Automata (Q5200097) (← links)
- Operational Accepting State Complexity: The Unary and Finite Case (Q5205038) (← links)
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION (Q5462121) (← links)
- Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
- Complement on Free and Ideal Languages (Q5500692) (← links)
- (Q5696194) (← links)
- NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs (Q5704371) (← links)
- THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS (Q5704376) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)
- Nondeterministic operational complexity in subregular languages (Q6093571) (← links)
- State complexity of finite partial languages (Q6100188) (← links)
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity (Q6163615) (← links)
