Efficient Learning of Weak Deterministic Büchi Automata

We present an efficient Angluin-style learning algorithm for weak deterministic Büchi automata (wDBAs). Different to ordinary deterministic Büchi and co-Büchi automata, wDBAs have a minimal normal form, and we show that we can learn this minimal normal form efficiently. We provide an improved result on the number of queries required and show on benchmarks that this theoretical advantage translates into significantly fewer queries: while previous approaches require a quintic number of queries, we only require quadratically many queries in the size of the canonic wDBA that recognises the target language.

Authors

• Mona Alluwaym
• Yong Li 0031
• Sven Schewe
• Qiyi Tang 0001

Keywords

No keywords are indexed for this paper.