Pages that link to "Item:Q703578"
From MaRDI portal
The following pages link to Minimizing finite automata is computationally hard (Q703578):
Displaying 24 items.
- Compression of finite-state automata through failure transitions (Q300258) (← links)
- The tractability frontier for NFA minimization (Q414869) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- String execution time for finite languages: max is easy, min is hard (Q642653) (← links)
- An approximation algorithm for state minimization in 2-MDFAs (Q855011) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- A maxmin problem on finite automata (Q1116710) (← links)
- Minimisation of automata (Q2074212) (← links)
- Computational complexity of problems for deterministic presentations of sofic shifts (Q2087461) (← links)
- Computational complexity of \(k\)-block conjugacy (Q2219057) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- (Q3832058) (← links)
- THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET (Q3988841) (← links)
- (Q4036599) (← links)
- (Q4452078) (← links)
- Minimizing GFG Transition-Based Automata (Q5091262) (← links)
- (Q5101349) (← links)
- (Q5216306) (← links)
- (Q5418252) (← links)
- Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
- Decision problems for reversible and permutation automata (Q6666806) (← links)
