M. Agrawal, N. Kayal & N. Saxena (2004):
PRIMES is in P.
Annals of Mathematics 160,
pp. 781–793,
doi:10.4007/annals.2004.160.781.
H. Černý (1964):
Poznámka k homogénnym eksperimentom s konečnými avtomatami.
Mat.-Fyz. Cas. Slovensk. Akad. Vied. (in Slovak) 14,
pp. 208–216.
K. El-Fakih, A. Petrenko & N. Yevtushenko (2006):
FSM Test Translation Through Context.
Lecture Notes in Computer Science 3964,
pp. 245–258,
doi:10.1007/11754008_16.
A. Gill (1961):
State-identification experiments in finite automata.
Information and Control,
pp. 132–154,
doi:10.1016/S0019-9958(61)80003-X.
T. Hibbard (1961):
Lest upper bounds on minimal terminal state experiments of two classes of sequential machines.
Journal of the ACM 8(4),
pp. 601–612,
doi:10.1145/321088.321098.
A. Klyachko, I. Rystsov & M. Spivak (1987):
In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton.
Cybernetics 23,
pp. 165–171,
doi:10.1007/BF01071771.
Z. Kohavi (1978):
Switching and Finite Automata Theory.
McGraw- Hill, New York.
N. Kushik, K. El-Fakih & N. Yevtushenko (2011):
Preset and adaptive homing experiments for nondeterministic finite state machines.
LNCS 6807,
pp. 215–224,
doi:10.1007/978-3-642-22256-6_20.
N. Kushik, K. El-Fakih, N. Yevtushenko & A. Cavalli (2014):
On adaptive experiments for nondeterministic finite state machines.
International Journal on Software Tools for Technology Transfer (in press),
doi:10.1007/s10009-014-0357-7.
N. Kushik, V. Kulyamin & N. Evtushenko (2014):
On the complexity of existence of homing sequences for nondeterministic finite state machines.
Programming and Computer Software,
pp. 333–336,
doi:10.1134/S0361768814060140.
E.F. Moore (1956):
Gedanken-experiments on sequential machines.
Automata Studies. Annals of Mathematical Studies 34,
pp. 129–153.
A. Petrenko & N. Yevtushenko (2011):
Adaptive Testing of Deterministic Implementations Specified by Nondeterministic FSMs.
LNCS 7019,
pp. 162–178,
doi:10.1007/978-3-642-24580-0_12.
S. Sandberg (2005):
Homing and Synchronization Sequences.
LNCS 3472,
pp. 3–55,
doi:10.1.1.108.2650.
T. Villa, N. Yevtushenko, R. Brayton, A. Mishchenko, A. Petrenko & A. Sangiovanni-Vincentelli (2012):
The Unknown Component Problem - Theory and Applications, chapter 2, 3,
pp. 9–72.
Springer,
doi:10.1007/978-0-387-68759-9.
M. Volkov (2008):
Synchronizing Automata and the Černý Conjecture.
LNCS 5196,
pp. 11–27,
doi:10.1007/978-3-540-88282-4_4.
M. Zhigulin, A. Kolomeets, N. Kushik & A. Shabaldin (2011):
Test generation strategies for IRC protocol implementation based EFSM model (in Russian).
Bulletin of the Tomsk Polytechnic University,
pp. 81–84.
eptcs@eptcs.org