F. Aarts
F.W. Vaandrager
2010
Learning I/O Automata
CONCUR 2010 - Concurrency Theory, 21th Inter. Conf., CONCUR 2010, Paris, France, August 31-September 3, 2010. Proc.
71–85
10.1007/978-3-642-15375-4_6
D. Angluin
1987
Learning Regular Sets from Queries and Counterexamples
Inf. Comput.
75
2
87–106
10.1016/0890-5401(87)90052-6
D. Angluin
U. Boker
D. Fisman
2016
Families of DFAs as Acceptors of omega-Regular Languages
41st Inter. Symp. on Mathematical Foundations of Computer Science, MFCS
11:1–11:14
10.4230/LIPIcs.MFCS.2016.11
D. Angluin
U. Boker
D. Fisman
2018
Families of DFAs as Acceptors of ω-Regular Languages
Logical Methods in Computer Science
Volume 14, Issue 1
10.23638/LMCS-14(1:15)2018
D. Angluin
D. Fisman
2014
Learning Regular Omega Languages
Algorithmic Learning Theory - 25th Inter. Conf., ALT Proc.
125–139
10.1007/978-3-319-11662-4_10
D. Angluin
D. Fisman
2016
Learning regular omega languages
Theor. Comput. Sci.
650
57–72
10.1016/j.tcs.2016.07.031
B. Balle
M. Mohri
2015
Learning Weighted Automata
Algebraic Informatics - 6th International Conference, CAI 2015
1–21
10.1007/978-3-319-23021-4_1
F. Bergadano
S. Varricchio
1996
Learning Behaviors of Automata from Multiplicity and Equivalence Queries
SIAM J. Comput.
25
6
1268–1280
10.1137/S009753979326091X
A. W. Biermann
J. A. Feldman
1972
On the Synthesis of Finite-State Machines from Samples of Their Behavior
IEEE Trans. Comput.
21
6
592–597
10.1109/TC.1972.5009015
M. Bojańczyk
2014
Transducers with Origin Information
Automata, Languages, and Programming - 41st Inter. Colloq., ICALP
26–37
10.1007/978-3-662-43951-7_3
M. Botincan
D. Babic
2013
Sigma*: symbolic learning of input-output specifications
40th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Language (POPL13)
443–456
10.1145/2429069.2429123
H. Calbrix
M. Nivat
A. Podelski
1994
Ultimately Periodic Words of Rationalıt w-Languages
Proc. of the 9th Inter. Conf. on Mathematical Foundations of Programming Semantics
Springer-Verlag
554–566
10.1007/3-540-58027-1_27
V. Diekert
P. Gastin
2008
First-order definable languages
Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas].
261–306
D. Drews
L. D'Antoni
2017
Learning Symbolic Automata
Tools and Algorithms for the Construction and Analysis of Systems - 23rd Inter. Conf., TACAS
173–189
10.1007/978-3-662-54577-5_10
A. Farzan
Y. Chenand E.M. Clarke
Y. Tsay
B. Wang
2008
Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
Tools and Algorithms for the Construction and Analysis of Systems
LNCS
4963
Springer Berlin Heidelberg
2–17
10.1007/978-3-540-78800-3_2
D. Fisman
2018
Inferring Regular Languages and ω-Languages
Journal of Logical and Algebraic Methods in Programming
98C
27–49
10.1016/j.jlamp.2018.03.002
M. Fliess
1974
Matrices de Hankel
Journal de Mathe\'matiques Pureset Appliqueés
197–224
D. M. Gabbay
A. Pnueli
S. Shelah
J. Stavi
1980
On the Temporal Basis of Fairness
Conf. Record of the 7th Annual ACM Symp. on Principles of Programming Languages
163–173
10.1145/567446.567462
O. Kupferman
G. Morgenstern
A. Murano
2006
Typeness for omega-regular Automata
Int. J. Found. Comput. Sci.
17
4
869–884
10.1142/S0129054106004157
M. Leucker
2006
Learning Meets Verification
Formal Methods for Components and Objects, 5th Inter. Symp., FMCO
127–151
10.1007/978-3-540-74792-5_6
O. Maler
I. Mens
2017
A Generic Algorithm for Learning Symbolic Automata from Membership Queries
Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday
146–169
10.1007/978-3-319-63121-9_8
O. Maler
A. Pnueli
1995
On the Learnability of Infinitary Regular Sets
Inf. Comput.
118
2
316–326
10.1006/inco.1995.1070
O. Maler
L. Staiger
1997
On Syntactic Congruences for Omega-Languages
Theor. Comput. Sci.
183
1
93–112
10.1016/S0304-3975(96)00312-X
Z. Manna
A. Pnueli
1990
A Hierarchy of Temporal Properties
Proc. of the Ninth Annual ACM Symp. on Principles of Distributed Computing
377–410
10.1145/93385.93442
I. Mens
O. Maler
2015
Learning Regular Languages over Large Ordered Alphabets
Logical Methods in Computer Science
11
3
10.2168/LMCS-11(3:13)2015
D. Perrin
J-E. Pin
2004
Infinite Words: Automata, Semigroups, Logic and Games
Pure and Applied Math
141
Elsevier
A. Pnueli
1977
The Temporal Logic of Programs
FOCS
46–57
10.1109/SFCS.1977.32
A. Rabinovich
2014
A Proof of Kamp's theorem
Logical Methods in Computer Science
10
1
10.2168/LMCS-10(1:14)2014
B. Le Saëc
1990
Saturating right congruences
ITA
24
545–560
S. Schewe
2010
Beyond Hyper-Minimisation—Minimising DBAs and DPAs is NP-Complete
IARCS Annual Conf. on Foundations of Software Technology and Theor. Comp. Science, FSTTCS
400–411
10.4230/LIPIcs.FSTTCS.2010.400
L. Staiger
1983
Finite-State omega-Languages
J. Comput. Syst. Sci.
27
3
434–448
10.1016/0022-0000(83)90051-X
D. Long Van
B. Le Saëc
I. Litovsky
1995
Characterizations of Rational omega-Languages by Means of Right Congruences
Theor. Comput. Sci.
143
1
1–21
10.1016/0304-3975(95)80022-2
K. W. Wagner
1975
A Hierarchy of Regular Sequence Sets
MFCS
445–449
10.1007/3-540-07389-2_231
P. Wolper
1983
Temporal Logic Can Be More Expressive
Information and Control
56
1/2
72–99
10.1016/S0019-9958(83)80051-5