P. A. Abdulla, A. Bouajjani, L. Holík, L. Kaati & T. Vojnar (2008):
Computing Simulations over Tree Automata.
In: TACAS'08,
LNCS 4963.
Springer,
pp. 93–108,
doi:10.1007/978-3-540-78800-3_8.
D. Brand & P. Zafiropulo (1983):
On Communicating Finite-State Machines.
J. ACM 30(2),
pp. 323–342,
doi:10.1145/322374.322380.
P. Chambart & P. Schnoebelen (2008):
Mixing Lossy and Perfect Fifo Channels.
In: CONCUR'08,
LNCS 5201.
Springer,
pp. 340–355,
doi:10.1007/978-3-540-85361-9_28.
K. Chatterjee, W. Dvořák, M. Henzinger & V. Loitzenbauer (2016):
Conditionally Optimal Algorithms for Generalized Büchi Games.
In: MFCS'16.
To appear.
L. Clemente & R. Mayr (2013):
Advanced automata minimization.
In: POPL'13.
ACM,
pp. 63–74,
doi:10.1145/2429069.2429079.
V. Diekert & G. Rozenberg (1995):
The Book of Traces.
World Scientific Publ. Co.,
doi:10.1142/2563.
D. L. Dill, A. J. Hu & H. Wong-Toi (1992):
Checking for Language Inclusion Using Simulation Relations.
In: CAV'91,
LNCS 575.
Springer,
pp. 255–265,
doi:10.1007/3-540-55179-4_25.
K. Etessami (2002):
A Hierarchy of Polynomial-Time Computable Simulations for Automata.
In: CONCUR'02,
LNCS 2421.
Springer,
pp. 131–144,
doi:10.1007/3-540-45694-5_10.
K. Etessami, T. Wilke & R. A. Schuller (2001):
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata.
In: ICALP'01,
LNCS 2076.
Springer,
pp. 694–707,
doi:10.1007/3-540-48224-5_57.
O. Finkel (2012):
Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language.
Int. J. Found. Comp. Sci 23(7),
pp. 1481–1498,
doi:10.1142/S0129054112400606.
C. Fritz & T. Wilke (2005):
Simulation relations for alternating Büchi automata.
TCS 338(1-3),
pp. 275–314,
doi:10.1016/j.tcs.2005.01.016.
M. Holtmann, L. Kaiser & W. Thomas (2012):
Degrees of Lookahead in Regular Infinite Games.
Logical Methods in Computer Science 8(3),
doi:10.2168/LMCS-8(3:24)2012.
M. Hutagalung, M. Lange & E. Lozes (2013):
Revealing vs. Concealing: More Simulation Games for Büchi Inclusion.
In: LATA'2013,
LNCS 7810.
Springer,
pp. 347–358,
doi:10.1007/978-3-642-37064-9_31.
M. Hutagalung, M. Lange & E. Lozes (2014):
Buffered Simulation Games for Büchi Automata.
In: AFL'14,
EPTCS 151,
pp. 286–300,
doi:10.4204/EPTCS.151.20.
S.C. Kleene (1943):
Recursive predicates and quantifiers.
Trans. Amer. Math. Soc. 53,
pp. 41–73,
doi:10.1090/S0002-9947-1943-0007371-8.
D. A. Martin (1975):
Borel determinacy.
Ann. Math. 102,
pp. 363–371,
doi:10.2307/1971035.
D.E. Muller & P.E. Schupp (1985):
The theory of ends, pushdown automata, and second-order logic.
Theoretical Computer Science 37(1),
pp. 51–75,
doi:10.1016/0304-3975(85)90087-8.
H. Rogers (1987):
Theory of recursive functions and effective computability (Reprint from 1967).
MIT Press.
J. Sakarovitch (1992):
The "last" decision problem for rational trace languages.
In: LATIN'92,
LNCS 583.
Springer,
pp. 460–473,
doi:10.1007/BFb0023848.
eptcs@eptcs.org