Pages that link to "Item:Q5448781"
From MaRDI portal
The following pages link to Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages (Q5448781):
Displaying 11 items.
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- A note on quantum sequential machines (Q1029358) (← links)
- Polynomially ambiguous probabilistic automata on restricted languages (Q2121470) (← links)
- On injectivity of quantum finite automata (Q2229947) (← links)
- Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← links)
- Freeness properties of weighted and probabilistic automata over bounded languages (Q2280319) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. (Q5089287) (← links)
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages (Q5091267) (← links)
- Acceptance Ambiguity for Quantum Automata (Q5092433) (← links)
- Decision Questions for Probabilistic Automata on Small Alphabets (Q6137871) (← links)