Publisher
Springer International Publishing
Reference25 articles.
1. Archive of Formal Proofs. https://www.isa-afp.org/topics.html
2. Bannai, H., Tomohiro, I., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: A new characterization of maximal repetitions by Lyndon trees. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics (December 2015)
3. Blanchette, J.C., Kaliszyk, C., Paulson, L.C., Urban, J.: Hammering towards QED. J. Form. Reason. 9(1), 101–148 (2016)
4. Lecture Notes in Computer Science;A Carpi,2014
5. Dolce, F., Restivo, A., Reutenauer, C.: On generalized Lyndon words. Theor. Comput. Sci. 777, 232–242 (2019)