Pages that link to "Item:Q1186807"
From MaRDI portal
The following pages link to The parallel complexity of finite-state automata problems (Q1186807):
Displaying 33 items.
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Branching automata with costs -- a way of reflecting parallelism in costs (Q703495) (← links)
- Finite-automaton aperiodicity is PSPACE-complete (Q809608) (← links)
- On NFAs where all states are final, initial, or both (Q1034621) (← links)
- A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
- On path equivalence of nondeterministic finite automata (Q1351166) (← links)
- Some undecidable problems for parallel communicating finite automata systems (Q1603408) (← links)
- Descriptional and computational complexity of the circuit representation of finite automata (Q1647686) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- On the computational complexity of problems related to distinguishability sets (Q1706155) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Problems on Finite Automata and the Exponential Time Hypothesis (Q2830210) (← links)
- Undecidability and hierarchy results for parallel communicating finite automata (Q2909096) (← links)
- On the computational capacity of parallel communicating finite automata (Q2909225) (← links)
- Minimisation of Multiplicity Tree Automata (Q2949446) (← links)
- PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES (Q3021983) (← links)
- Note on the complexity of Las Vegas automata problems (Q3421911) (← links)
- On the Computational Capacity of Parallel Communicating Finite Automata (Q3533006) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- On Parallel Implementations of Deterministic Finite Automata (Q3637342) (← links)
- Parallel decision procedures for finite state automata (Q4291044) (← links)
- (Q4513850) (← links)
- A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton (Q4571178) (← 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)
- Decision problems for reversible and permutation automata (Q6666806) (← links)
- On the complexity of decision problems for parameterized finite state synchronous transducers (Q6666811) (← links)