Regular ω-languages with an informative right congruence

Aarts, 2010, Learning I/O automata, 71 Angluin, 1987, Learning regular sets from queries and counterexamples, Inf. Comput., 75, 87, 10.1016/0890-5401(87)90052-6 Angluin, 2016, Families of DFAs as acceptors of omega-regular languages, 11:1 Angluin, 2018, Families of DFAs as acceptors of ω-regular languages, Log. Methods Comput. Sci., 14, 1 Angluin, 2014, Learning Regular Omega Languages, 125 Angluin, 2016, Learning regular omega languages, Theor. Comput. Sci., 650, 57, 10.1016/j.tcs.2016.07.031 Balle, 2015, Learning weighted automata, 1 Bergadano, 1996, Learning behaviors of automata from multiplicity and equivalence queries, SIAM J. Comput., 25, 1268, 10.1137/S009753979326091X Biermann, 1972, On the synthesis of finite-state machines from samples of their behavior, IEEE Trans. Comput., 21, 592, 10.1109/TC.1972.5009015 Bojańczyk, 2014, Transducers with origin information, 26 Botincan, 2013, Sigma*: symbolic learning of input-output specifications, 443 Calbrix, 1994, Ultimately periodic words of rational w-languages, 554 Diekert, 2008, First-order definable languages, 261 Drews, 2017, Learning symbolic automata, 173 Farzan, 2008, Extending automated compositional verification to the full class of omega-regular languages, vol. 4963, 2 Fisman, 2018, Inferring regular languages and ω-languages, J. Log. Algebraic Methods Program., 98C, 27, 10.1016/j.jlamp.2018.03.002 Fliess, 1974, Matrices de Hankel, J. Math. Pures Appl., 197 Gabbay, 1980, On the temporal basis of fairness, 163 Leucker, 2006, Learning meets verification, 127 Löding, 2000, Alternating automata and logics over infinite words, vol. 1872, 521 Maler, 2017, A generic algorithm for learning symbolic automata from membership queries, 146 Maler, 1995, On the Learnability of infinitary regular sets, Inf. Comput., 118, 316, 10.1006/inco.1995.1070 Maler, 1997, On syntactic congruences for omega-languages, Theor. Comput. Sci., 183, 93, 10.1016/S0304-3975(96)00312-X Manna, 1990, A hierarchy of temporal properties, 377 Mens, 2015, Learning regular languages over large ordered alphabets, Log. Methods Comput. Sci., 11, 1, 10.2168/LMCS-11(3:13)2015 Pnueli, 1977, The temporal logic of programs, 46 Rabinovich, 2014, A proof of Kamp's theorem, Log. Methods Comput. Sci., 10, 1, 10.2168/LMCS-10(1:14)2014 Saëc, 1990, Saturating right congruences, Inform. Théor. Appl., 24, 545, 10.1051/ita/1990240605451 Schewe, 2010, Beyond hyper-minimisation—minimising DBAs and DPAs is NP-complete, 400 Staiger, 1983, Finite-state omega-languages, J. Comput. Syst. Sci., 27, 434, 10.1016/0022-0000(83)90051-X Van, 1995, Characterizations of rational omega-languages by means of right congruences, Theor. Comput. Sci., 143, 1, 10.1016/0304-3975(95)80008-5 Wagner, 1975, A hierarchy of regular sequence sets, 445 Wolper, 1983, Temporal logic can be more expressive, Inf. Control, 56, 72, 10.1016/S0019-9958(83)80051-5