Jarkko Peltomäki

Eur. J. Comb., 2024

Learning test generators for cyber-physical systems.

[BibT_eX]

[DOI]

CoRR, 2024

The repetition threshold for ternary rich words.

[BibT_eX]

[DOI]

James D. Currie

Lucas Mol

CoRR, 2024

Adaptive Test Generation for Unmanned Aerial Vehicles using WOGAN-UAV.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM/IEEE International Workshop on Search-Based and Fuzz Testing, 2024

Testing cyber-physical systems with explicit output coverage.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Software Testing, Verification and Validation, ICST 2024, 2024

2023

Requirement falsification for cyber-physical systems using generative models.

[BibT_eX]

[DOI]

CoRR, 2023

SBFT Tool Competition 2023 - Cyber-Physical Systems Track.

[BibT_eX]

[DOI]

Proceedings of the IEEE/ACM International Workshop on Search-Based and Fuzz Testing, 2023

ARCH-COMP23 Category Report: Falsification.

[BibT_eX]

[DOI]

Proceedings of 10th International Workshop on Applied Verification of Continuous and Hybrid Systems (ARCH23), 2023

2022

Automatic winning shifts.

[BibT_eX]

[DOI]

Ville Salo

Inf. Comput., 2022

WOGAN at the SBST 2022 CPS Tool Competition.

[BibT_eX]

[DOI]

Frankie Spencer

Proceedings of the 15th IEEE/ACM International Workshop on Search-Based Software Testing, 2022

Wasserstein Generative Adversarial Networks for Online Test Generation for Cyber Physical Systems.

[BibT_eX]

[DOI]

Frankie Spencer

Proceedings of the 15th IEEE/ACM International Workshop on Search-Based Software Testing, 2022

Falsification of Multiple Requirements for Cyber-Physical Systems Using Online Generative Adversarial Networks and Multi-Armed Bandits.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE International Conference on Software Testing, 2022

2021

On prefix palindromic length of automatic words.

[BibT_eX]

[DOI]

Anna E. Frid

Enzo Laborde

Theor. Comput. Sci., 2021

Standard words and solutions of the word equation X12⋯Xn2=(X1⋯Xn)2.

[BibT_eX]

[DOI]

Aleksi Saarela

J. Comb. Theory A, 2021

2020

More on the dynamics of the symbolic square root map.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Standard words and solutions of the word equation $X_1^2 \dotsm X_n^2 = (X_1 \dotsm X_n)^2$.

[BibT_eX]

[DOI]

Aleksi Saarela

CoRR, 2020

Avoiding abelian powers cyclically.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2020

All Growth Rates of Abelian Exponents Are Attained by Infinite Binary Words.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

On winning shifts of marked uniform substitutions.

[BibT_eX]

[DOI]

Ville Salo

RAIRO Theor. Informatics Appl., 2019

Abelian periods of factors of Sturmian words.

[BibT_eX]

[DOI]

CoRR, 2019

Automatic sequences based on Parry or Bertrand numeration systems.

[BibT_eX]

[DOI]

Adeline Massuir

Michel Rigo

Adv. Appl. Math., 2019

Every Nonnegative Real Number Is an Abelian Critical Exponent.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018

On k-abelian Equivalence and Generalized Lagrange Spectra.

[BibT_eX]

[DOI]

CoRR, 2018

2017

A Square Root Map on Sturmian Words.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

More on the Dynamics of the Symbolic Square Root Map - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016

Abelian powers and repetitions in Sturmian words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Remarks on Privileged Words.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

2015

Characterization of repetitions in Sturmian words: A new proof.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Privileged factors in the Thue-Morse word - A comparison of privileged words and palindromes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

A Square Root Map on Sturmian Words - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2013

Introducing privileged words: Privileged complexity of Sturmian words.

[BibT_eX]

[DOI]