No. Title Author Year
1 Strongly Unambiguous B├╝chi Automata Are Polynomially Predictable With Membership Queries Angluin, Dana et al. 2020
2 Query Learning of Derived Omega-Tree Languages in Polynomial Time Angluin, Dana et al. 2017
3 Families of DFAs as Acceptors of omega-Regular Languages Angluin, Dana et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 3

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI