P. A. Abdulla, A. Bouajjani, L. Holík, L. Kaati & T. Vojnar (2008):
Computing Simulations over Tree Automata.
In: TACAS'08,
Lecture Notes in Computer Science 4963.
Springer,
pp. 93–108,
doi:10.1007/978-3-540-78800-3_8.
J. Berstel (1979):
Transductions and Context-Free Languages.
Leitfäden der angewandten Mathematik und Mechanik.
Teubner,
doi:10.1007/978-3-663-09367-1.
A. Blumensath & E. Grädel (2000):
Automatic Structures.
In: Proc. 15th IEEE Symp. on Logic in Computer Science, LICS'00.
IEEE,
pp. 51–62,
doi:10.1109/LICS.2000.855755.
D. Brand & P. Zafiropulo (1983):
On Communicating Finite-State Machines.
J. ACM 30(2),
pp. 323–342,
doi:10.1145/322374.322380.
O. Carton (2010):
Right-Sequential Functions on Infinite Words.
In: Proc. 5th Int. Conf. on Computer Science in Russia, CSR'10,
Lecture Notes in Computer Science 6072.
Springer,
pp. 96–106,
doi:10.1007/978-3-642-13182-0.
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.
L. Clemente & R. Mayr (2013):
Advanced automata minimization.
In: POPL'13.
ACM,
pp. 63–74,
doi:10.1145/2429069.2429079.
V. Diekert & Y. Métivier (1997):
Partial Commutation and Traces.
In: G. Rozenberg & A. Salomaa: Handbook of Formal Languages 3.
Springer,
pp. 457–533,
doi:10.1007/978-3-642-59126-6_8.
D. L. Dill, A. J. Hu & H. Wong-Toi (1992):
Checking for Language Inclusion Using Simulation Preorders.
In: CAV'91,
LNCS 575.
Springer,
pp. 255–265,
doi:10.1007/3-540-55179-4_25.
E. A. Emerson (1996):
Automated Temporal Reasoning about Reactive Systems,
pp. 41–101,
LNCS 1043.
Springer,
New York, NY, USA,
doi:10.1007/3-540-60915-6_3.
E. A. Emerson & C. L. Lei (1986):
Efficient Model Checking in Fragments of the Propositional μ–Calculus.
In: Symposion on Logic in Computer Science.
IEEE,
Washington, D.C., USA,
pp. 267–278.
K. Etessami (2002):
A Hierarchy of Polynomial-Time Computable Simulations for Automata.
In: CONCUR'02,
Lecture Notes in Computer Science 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.
C. Fritz & T. Wilke (2005):
Simulation relations for alternating Büchi automata.
Theor. Comput. Sci 338(1-3),
pp. 275–314,
doi:10.1016/j.tcs.2005.01.016.
F. Gire & M. Nivat (1984):
Relations rationelles infinitaires.
Calcolo 21,
pp. 91–125,
doi:10.1007/BF02575909.
Y. Gurevich & L. Harrington (1982):
Trees, Automata, and Games.
In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5-7, 1982, San Francisco, California, USA,
pp. 60–65,
doi:10.1145/800070.802177.
M. Hutagalung, N. Hundeshagen, D. Kuske, M. Lange & E. Lozes (2016):
Multi-Buffer Simulations for Trace Language Inclusion.
In preparation.
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.
M. Jurdziński (2000):
Small progress measures for solving parity games.
In: H. Reichel & S. Tison: STACS'00,
LNCS 1770.
Springer,
pp. 290–301,
doi:10.1007/3-540-46541-3_24.
M. Nivat (1981):
Infinitary Relations.
In: Proc. 6th Coll. on Trees in Algebra and Programming, CAAP'81,
Lecture Notes in Computer Science 112.
Springer,
pp. 46–75,
doi:10.1007/3-540-10828-9_54.
E. Post (1946):
A variant of a recursively unsolvable problem.
Bulletin of the American Mathematical Society 53,
pp. 264–268,
doi:10.1090/S0002-9904-1946-08555-9.
eptcs@eptcs.org