B. Alexeev (2004):
Minimal DFA for Testing Divisibility.
Journal of Computer and System Sciences 69(2),
pp. 235–243,
doi:10.1016/j.jcss.2004.02.001.
Z. Chase (2021):
Separating Words and Trace Reconstruction.
In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC),
pp. 21–31,
doi:10.1145/3406325.3451118.
E. D. Demaine, S. Eisenstat, J. Shallit & D. A. Wilson (2011):
Remarks on Separating Words.
In: M. Holzer, M. Kutrib & G. Pighizzini: Proceedings of the 13th International Workshop on Descriptional Complexity of Formal Systems (DCFS),
Lecture Notes in Computer Science 6808.
Springer,
Berlin, Heidelberg,
pp. 147–157,
doi:10.1007/978-3-642-22600-7.
P. Goralčík & V. Koubek (1986):
On Discerning Words by Automata.
In: L. Kott: Proceedings of the 13th International Colloquium on Automata, Languages and Programming (ICALP),
Lecture Notes in Computer Science 226.
Springer,
Berlin, Heidelberg,
pp. 116–122,
doi:10.1007/3-540-16761-7_61.
I. Niven, H. S. Zuckerman & H. L. Montgomery (1991):
An Introduction to the Theory of Numbers.
Wiley.
J. M. Robson (1989):
Separating strings with small automata.
Information Processing Letters 30(4),
pp. 209–214,
doi:10.1016/0020-0190(89)90215-9.
J. B. Rosser & L. Schoenfeld (1962):
Approximate formulas for some functions of prime numbers.
Illinois Journal of Mathematics 6(1),
pp. 64–94,
doi:10.1215/ijm/1255631807.
K. Sutner (2009):
Divisibility and State Complexity.
The Mathematica Journal 11(3),
pp. 430–445,
doi:10.3888/tmj.11.3-8.
N. Tran (2022):
Variations of the Separating Words Problem.
In: P. Caron & L. Mignot: Proceedings of the 26th International Conference on Implementation and Application of Automata (CIAA),
Lecture Notes in Computer Science 13266.
Springer,
Berlin, Heidelberg,
pp. 165–176,
doi:10.1007/978-3-031-07469-1_13.
M. N. Vyalyi & R. A. Gimadeev (2014):
Separating words by occurrences of subwords.
Journal of Applied and Industrial Mathematics 8(2),
pp. 293–299,
doi:10.1134/S1990478914020161.
eptcs@eptcs.org