Pages that link to "Item:Q1186807"
From MaRDI portal
The following pages link to The parallel complexity of finite-state automata problems (Q1186807):
Displayed 17 items.
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Finite-automaton aperiodicity is PSPACE-complete (Q809608) (← links)
- A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- On the computational complexity of problems related to distinguishability sets (Q1706155) (← links)
- Problems on Finite Automata and the Exponential Time Hypothesis (Q2830210) (← links)
- Minimisation of Multiplicity Tree Automata (Q2949446) (← links)
- Note on the complexity of Las Vegas automata problems (Q3421911) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Minimal Reversible Deterministic Finite Automata (Q4640040) (← links)
- (Q4988162) (← links)
- (Q5111236) (← links)
- The complexity of weakly recognizing morphisms (Q5223827) (← links)
- More on Minimizing Finite Automata with Errors — Nondeterministic Machines (Q5268394) (← links)
- Operational State Complexity and Decidability of Jumping Finite Automata (Q5384429) (← links)
- FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS (Q5495421) (← links)
- Minimal and Hyper-Minimal Biautomata (Q5890813) (← links)