1 paper · 1 filter
Cristopher Moore, Gabriel Istrate, Demetrios Demopoulos +1
We compute the probability of satisfiability of a class of random Horn-SAT formulae, motivated by a connection with the nonemptiness problem of finite tree automata. In particular,…