


default search action
"Probabilistic Finite Automaton Emptiness Is Undecidable for a Fixed Automaton."
Günter Rote (2025)
- Günter Rote:
Probabilistic Finite Automaton Emptiness Is Undecidable for a Fixed Automaton. MFCS 2025: 86:1-86:18

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.