Back
  1. Home
  2. Profile of Markus Whiteland (ULiège)
Profil

Whiteland Markus

Département de mathématique > Mathématiques discrètes

Mathematics

See author's contact details
Main Referenced Co-authors
Rigo, Michel  (5)
Stipulanti, Manon  (5)
Main Referenced Keywords
Abelian complexity (3); Combinatorics on words (3); Sturmian words (3); Binomial complexity (2); combinatorics on words (2);
Main Referenced Disciplines
Mathematics (5)

Publications (total 5)

The most downloaded
70 downloads
Rigo, M., Stipulanti, M., & Whiteland, M. (2023). Gapped Binomial Complexities in Sequences. In 2023 IEEE International Symposium on Information Theory (ISIT) (pp. 1294-1299). IEEE. https://hdl.handle.net/2268/302524

The most cited

5 citations (Scopus®)

Rigo, M., Stipulanti, M., & Whiteland, M. (2022). Binomial Complexities and Parikh-Collinear Morphisms. Lecture Notes in Computer Science, 13257, 251-262. doi:10.1007/978-3-031-05578-2_20 https://hdl.handle.net/2268/266990

Rigo, M., Stipulanti, M., & Whiteland, M. (2024). Characterizations of families of morphisms and words via binomial complexities. European Journal of Combinatorics. doi:10.1016/j.ejc.2024.103932
Peer Reviewed verified by ORBi

Rigo, M., Stipulanti, M., & Whiteland, M. (2023). Automaticity and Parikh-collinear Morphisms. In Robert Merças & Anna E. Frid (Eds.), Words 2023 (pp. 247-260). Springer.
Peer reviewed

Rigo, M., Stipulanti, M., & Whiteland, M. (2023). Gapped Binomial Complexities in Sequences. In 2023 IEEE International Symposium on Information Theory (ISIT) (pp. 1294-1299). IEEE.
Peer reviewed

Rigo, M., Stipulanti, M., & Whiteland, M. (2022). Binomial Complexities and Parikh-Collinear Morphisms. Lecture Notes in Computer Science, 13257, 251-262. doi:10.1007/978-3-031-05578-2_20
Peer reviewed

Rigo, M., Stipulanti, M., & Whiteland, M. (2022). On extended boundary sequences of morphic and Sturmian words. Leibniz International Proceedings in Informatics, 241, 79. doi:10.4230/LIPIcs.MFCS.2022.79
Peer Reviewed verified by ORBi

Contact ORBi