Probabilistic Finite Automaton Emptiness is undecidable.

Published in: CoRR (2024)

Keyphrases

finite automaton
tree automata
finite automata
probabilistic model
bayesian networks
np complete
generative model
building blocks
sufficient conditions
uncertain data