Fingerprint
Dive into the research topics of 'Strongly unambiguous Büchi automata are polynomially predictable with membership queries'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Strongly unambiguous Büchi automata are polynomially predictable with membership queries
- Dana Angluin
- , Timos Antonopoulos
- , Dana Fisman
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review