The following pages link to (Q4681320):
Displayed 20 items.
- Incomplete operational transition complexity of regular languages (Q498392) (← 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)
- State complexity of basic language operations combined with reversal (Q948089) (← links)
- On the Hopcroft's minimization technique for DFA and DFCA (Q1019723) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- Nondeterministic state complexity of nested word automata (Q2271435) (← links)
- Estimation of state complexity of combined operations (Q2271462) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- State complexity of cyclic shift (Q3515466) (← links)
- Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← links)
- Analysing Complexity in Classes of Unary Automatic Structures (Q3618610) (← links)
- (Q5376657) (← links)
- Assisted Problem Solving and Decompositions of Finite Automata (Q5448655) (← links)