conftrace_

nondeterministic finite automaton

2 papers

Explore in graph

Also known as

NFA

Co-occurring keywords · papers mentioning both

automaton equivalence (1) automata equivalence (1) instance partial labels (1) pairwise observations (1) pspace completeness (1) quantified boolean formula (1) forward-backward algorithm (1) formal verification (1) weak supervision (1) expectation maximization (1)

Papers

A General Framework for Learning from Weak Supervision ICML 2024 Toward Determining NFA Equivalence via QBFs (Student Abstract) AAAI 2021