Strongly Unambiguous Bchi Automata Are Polynomially Predictable With Membership Queries.

Dana Angluin, Timos Antonopoulos, Dana Fisman

Browse the full CSL paper archive.