Follow
Markus A. Whiteland
Markus A. Whiteland
Department of Computer Science, Loughborough University
Verified email at lboro.ac.uk - Homepage
Title
Cited by
Cited by
Year
What’s decidable about linear loops?
T Karimov, E Lefaucheux, J Ouaknine, D Purser, A Varonka, ...
Proceedings of the ACM on Programming Languages 6 (POPL), 1-25, 2022
262022
Degrees of transducibility
J Endrullis, JW Klop, A Saarela, M Whiteland
International Conference on Combinatorics on Words, 1-13, 2015
162015
On cardinalities of k-abelian equivalence classes
J Karhumäki, S Puzynina, M Rao, MA Whiteland
Theoretical Computer Science 658, 190-204, 2017
152017
A square root map on Sturmian words
J Peltomäki, M Whiteland
Combinatorics on Words: 10th International Conference, WORDS 2015, Kiel …, 2015
122015
On positivity and minimality for second-order holonomic sequences
G Kenison, O Klurman, E Lefaucheux, F Luca, P Moree, J Ouaknine, ...
arXiv preprint arXiv:2007.12282, 2020
112020
The orbit problem for parametric linear dynamical systems
C Baier, F Funke, S Jantsch, T Karimov, E Lefaucheux, F Luca, ...
arXiv preprint arXiv:2104.10634, 2021
72021
Reachability in dynamical systems with rounding
C Baier, F Funke, S Jantsch, T Karimov, E Lefaucheux, J Ouaknine, ...
arXiv preprint arXiv:2009.13353, 2020
72020
On the k-abelian equivalence relation of finite words
MA Whiteland
TUCS Dissertations 241, 2019
72019
Binomial complexities and Parikh-collinear morphisms
M Rigo, M Stipulanti, MA Whiteland
International Conference on Developments in Language Theory, 251-262, 2022
62022
On abelian subshifts
J Karhumäki, S Puzynina, MA Whiteland
International Conference on Developments in Language Theory, 453-464, 2018
62018
k-Abelian equivalence and rationality
J Cassaigne, J Karhumäki, S Puzynina, MA Whiteland
Fundamenta Informaticae 154 (1-4), 65-94, 2017
62017
Abelian closures of infinite binary words
S Puzynina, MA Whiteland
Journal of Combinatorial Theory, Series A 185, 105524, 2022
52022
Equations over the k-Binomial Monoids
MA Whiteland
International Conference on Combinatorics on Words, 185-197, 2021
52021
Characterizations of families of morphisms and words via binomial complexities
M Rigo, M Stipulanti, MA Whiteland
European Journal of Combinatorics 118, 103932, 2024
42024
Automaticity and Parikh-collinear morphisms
M Rigo, M Stipulanti, MA Whiteland
International Conference on Combinatorics on Words, 247-260, 2023
42023
The boundedness and zero isolation problems for weighted automata over nonnegative rationals
W Czerwiński, E Lefaucheux, F Mazowiecki, D Purser, M Whiteland
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022
42022
Every nonnegative real number is an abelian critical exponent
J Peltomäki, MA Whiteland
International Conference on Combinatorics on Words, 275-285, 2019
42019
On -abelian Equivalence and Generalized Lagrange Spectra
J Peltomäki, MA Whiteland
arXiv preprint arXiv:1809.09047, 2018
42018
Gapped Binomial Complexities in Sequences
M Rigo, M Stipulanti, MA Whiteland
2023 IEEE International Symposium on Information Theory (ISIT), 1294-1299, 2023
32023
Avoiding abelian powers cyclically
J Peltomäki, MA Whiteland
Advances in Applied Mathematics 121, 102095, 2020
32020
The system can't perform the operation now. Try again later.
Articles 1–20