Strongly unambiguous Büchi automata are polynomially predictable with membership queries

Dana Angluin, Timos Antonopoulos, Dana Fisman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Fingerprint

Dive into the research topics of 'Strongly unambiguous Büchi automata are polynomially predictable with membership queries'. Together they form a unique fingerprint.

Engineering & Materials Science