default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJarkko Peltomäki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Jarkko Peltomäki:
Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents. Eur. J. Comb. 118: 103942 (2024)- [c11]Jarkko Peltomäki, Jesper Winsten, Maxime Methais, Ivan Porres:
Testing cyber-physical systems with explicit output coverage. ICSTW 2024: 128-136 - [c10]Jesper Winsten
, Valentin Soloviev, Jarkko Peltomäki, Ivan Porres:
Adaptive Test Generation for Unmanned Aerial Vehicles using WOGAN-UAV. SBFT@ICSE 2024: 43-44 - [i20]James D. Currie, Lucas Mol, Jarkko Peltomäki:
The repetition threshold for ternary rich words. CoRR abs/2409.12068 (2024) - [i19]Jarkko Peltomäki, Ivan Porres:
Learning test generators for cyber-physical systems. CoRR abs/2410.03202 (2024) - 2023
- [c9]Claudio Menghi, Paolo Arcaini, Walstan Baptista, Gidon Ernst, Georgios Fainekos, Federico Formica, Sauvik Gon, Tanmay Khandait, Atanu Kundu, Giulia Pedrielli, Jarkko Peltomäki, Ivan Porres, Rajarshi Ray, Masaki Waga, Zhenya Zhang:
ARCH-COMP23 Category Report: Falsification. ARCH 2023: 151-169 - [c8]Matteo Biagiola, Stefan Klikovits, Jarkko Peltomäki, Vincenzo Riccio:
SBFT Tool Competition 2023 - Cyber-Physical Systems Track. SBFT 2023: 45-48 - [i18]Jarkko Peltomäki, Ivan Porres:
Requirement falsification for cyber-physical systems using generative models. CoRR abs/2310.20493 (2023) - 2022
- [j13]Jarkko Peltomäki, Ville Salo:
Automatic winning shifts. Inf. Comput. 285(Part): 104883 (2022) - [c7]Jarkko Peltomäki, Ivan Porres:
Falsification of Multiple Requirements for Cyber-Physical Systems Using Online Generative Adversarial Networks and Multi-Armed Bandits. ICST Workshops 2022: 21-28 - [c6]Jarkko Peltomäki, Frankie Spencer, Ivan Porres:
Wasserstein Generative Adversarial Networks for Online Test Generation for Cyber Physical Systems. SBST@ICSE 2022: 1-5 - [c5]Jarkko Peltomäki, Frankie Spencer, Ivan Porres:
WOGAN at the SBST 2022 CPS Tool Competition. SBST@ICSE 2022: 53-54 - [i17]Jarkko Peltomäki, Ivan Porres:
Falsification of Multiple Requirements for Cyber-Physical Systems Using Online Generative Adversarial Networks and Multi-Armed Bandits. CoRR abs/2205.11057 (2022) - [i16]Jarkko Peltomäki, Frankie Spencer, Ivan Porres:
Wasserstein Generative Adversarial Networks for Online Test Generation for Cyber Physical Systems. CoRR abs/2205.11060 (2022) - [i15]Jarkko Peltomäki, Frankie Spencer, Ivan Porres:
WOGAN at the SBST 2022 CPS Tool Competition. CoRR abs/2205.11064 (2022) - 2021
- [j12]Jarkko Peltomäki, Aleksi Saarela:
Standard words and solutions of the word equation X12⋯Xn2=(X1⋯Xn)2. J. Comb. Theory A 178: 105340 (2021) - [j11]Anna E. Frid, Enzo Laborde, Jarkko Peltomäki:
On prefix palindromic length of automatic words. Theor. Comput. Sci. 891: 13-23 (2021) - [i14]Jarkko Peltomäki:
Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents. CoRR abs/2103.08351 (2021) - [i13]Jarkko Peltomäki, Ville Salo:
Automatic winning shifts. CoRR abs/2106.07249 (2021) - 2020
- [j10]Jarkko Peltomäki, Markus A. Whiteland:
Avoiding abelian powers cyclically. Adv. Appl. Math. 121: 102095 (2020) - [j9]Jarkko Peltomäki, Markus A. Whiteland:
More on the dynamics of the symbolic square root map. Theor. Comput. Sci. 806: 10-27 (2020) - [c4]Jarkko Peltomäki, Markus A. Whiteland:
All Growth Rates of Abelian Exponents Are Attained by Infinite Binary Words. MFCS 2020: 79:1-79:10 - [i12]Jarkko Peltomäki, Aleksi Saarela:
Standard words and solutions of the word equation $X_1^2 \dotsm X_n^2 = (X_1 \dotsm X_n)^2$. CoRR abs/2004.14657 (2020) - [i11]Jarkko Peltomäki, Markus A. Whiteland:
Avoiding abelian powers cyclically. CoRR abs/2006.06307 (2020) - [i10]Anna E. Frid, Enzo Laborde, Jarkko Peltomäki:
On prefix palindromic length of automatic words. CoRR abs/2009.02934 (2020)
2010 – 2019
- 2019
- [j8]Adeline Massuir, Jarkko Peltomäki, Michel Rigo:
Automatic sequences based on Parry or Bertrand numeration systems. Adv. Appl. Math. 108: 11-30 (2019) - [j7]Jarkko Peltomäki, Ville Salo:
On winning shifts of marked uniform substitutions. RAIRO Theor. Informatics Appl. 53(1-2): 51-66 (2019) - [c3]Jarkko Peltomäki, Markus A. Whiteland:
Every Nonnegative Real Number Is an Abelian Critical Exponent. WORDS 2019: 275-285 - [i9]Jarkko Peltomäki:
Abelian periods of factors of Sturmian words. CoRR abs/1905.06138 (2019) - [i8]Jarkko Peltomäki, Markus A. Whiteland:
Every nonnegative real number is an abelian critical exponent. CoRR abs/1906.00665 (2019) - 2018
- [i7]Jarkko Peltomäki, Markus A. Whiteland:
More on the dynamics of the symbolic square root map. CoRR abs/1801.00920 (2018) - [i6]Jarkko Peltomäki, Markus A. Whiteland:
On k-abelian Equivalence and Generalized Lagrange Spectra. CoRR abs/1809.09047 (2018) - [i5]Adeline Massuir, Jarkko Peltomäki, Michel Rigo:
Automatic sequences based on Parry or Bertrand numeration systems. CoRR abs/1810.11081 (2018) - 2017
- [j6]Jarkko Peltomäki, Markus A. Whiteland:
A Square Root Map on Sturmian Words. Electron. J. Comb. 24(1): 1 (2017) - [c2]Jarkko Peltomäki, Markus A. Whiteland:
More on the Dynamics of the Symbolic Square Root Map - (Extended Abstract). WORDS 2017: 97-108 - [i4]Jarkko Peltomäki, Ville Salo:
On winning shifts of marked uniform substitutions. CoRR abs/1705.08747 (2017) - 2016
- [j5]Michael Forsyth, Amlesh Jayakumar, Jarkko Peltomäki, Jeffrey O. Shallit:
Remarks on Privileged Words. Int. J. Found. Comput. Sci. 27(4): 431-442 (2016) - [j4]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Jarkko Peltomäki, Élise Prieur-Gaston:
Abelian powers and repetitions in Sturmian words. Theor. Comput. Sci. 635: 16-34 (2016) - 2015
- [j3]Jarkko Peltomäki:
Privileged factors in the Thue-Morse word - A comparison of privileged words and palindromes. Discret. Appl. Math. 193: 187-199 (2015) - [j2]Jarkko Peltomäki:
Characterization of repetitions in Sturmian words: A new proof. Inf. Process. Lett. 115(11): 886-891 (2015) - [c1]Jarkko Peltomäki, Markus A. Whiteland:
A Square Root Map on Sturmian Words - (Extended Abstract). WORDS 2015: 197-209 - [i3]Jarkko Peltomäki, Markus A. Whiteland:
A square root map on Sturmian words. CoRR abs/1509.06349 (2015) - 2014
- [i2]Jarkko Peltomäki:
Characterization of Repetitions in Sturmian Words: A New Proof. CoRR abs/1411.5474 (2014) - 2013
- [j1]Jarkko Peltomäki:
Introducing privileged words: Privileged complexity of Sturmian words. Theor. Comput. Sci. 500: 57-67 (2013) - 2012
- [i1]Jarkko Peltomäki:
Introducing Privileged Words: Privileged Complexity of Sturmian Words. CoRR abs/1210.3146 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 00:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
