Author of the publication

Polynomial Identification of ømega-Automata.

, , and . TACAS (2), volume 12079 of Lecture Notes in Computer Science, page 325-343. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Stabilizing Consensus in Mobile Networks., , and . DCOSS, volume 4026 of Lecture Notes in Computer Science, page 37-50. Springer, (2006)The Power of Random Counterexamples., and . ALT, volume 76 of Proceedings of Machine Learning Research, page 452-465. PMLR, (2017)Learning and verifying quantified boolean queries by example., , , , and . PODS, page 49-60. ACM, (2013)Learning Monotone DNF with an Incomplete Membership Oracle., and . COLT, page 139-146. Morgan Kaufmann, (1991)Learning Conjunctions of Horn Clauses (Abstract)., , and . COLT, page 387. Morgan Kaufmann, (1990)Learning Regular Languages via Alternating Automata., , and . IJCAI, page 3308-3314. AAAI Press, (2015)Inference of Reversible Languages.. J. ACM, 29 (3): 741-765 (1982)Learning a Hidden Hypergraph., and . COLT, volume 3559 of Lecture Notes in Computer Science, page 561-575. Springer, (2005)Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries., , and . CSL, volume 152 of LIPIcs, page 8:1-8:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Families of DFAs as Acceptors of ω-Regular Languages., , and . Logical Methods in Computer Science, (2018)