Results 1 to 10 of about 210,069 (312)

On the boundary sequence of an automatic sequence

open access: yesDiscrete Mathematics, 2022
A `boundary' of a word \(w_i\cdots w_{i+n}\) over a finite alphabet is the word \(w_iw_{i+n}\), and the set of all boundaries of words of length \(n+1\) appearing in a sequence \(w=w_1w_2\cdots\) is denoted \(\partial_{w}(n)\), giving a `boundary sequence' \((\partial_w(n))_{n\ge 1}\) associated to \(w\). \textit{J. Chen} and \textit{Z.-X. Wen} [Theor.
Xiao-Tao Lu, Zhi-Xiong Wen
exaly   +2 more sources

A deep learning-based automatic segmentation model for diffuse midline glioma with H3K27M alteration [PDF]

open access: yesFrontiers in Oncology
BackgroundDiffuse midline glioma (DMG) is a fatal tumor that emerges in the brainstem and thalamus. Compared with microsurgery and chemotherapy, radiotherapy is currently regarded as a safer and more effective treatment option.
Yong Deng   +3 more
doaj   +2 more sources

Automatic sequence identification in multicentric prostate multiparametric MRI datasets for clinical machine-learning [PDF]

open access: yesInsights into Imaging
Objectives To present an accurate machine-learning (ML) method and knowledge-based heuristics for automatic sequence-type identification in multi-centric multiparametric MRI (mpMRI) datasets for prostate cancer (PCa) ML.
José Guilherme de Almeida   +10 more
doaj   +2 more sources

The Critical Exponent is Computable for Automatic Sequences [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
The critical exponent of an infinite word is defined to be the supremum of the exponent of each of its factors. For k-automatic sequences, we show that this critical exponent is always either a rational number or infinite, and its value is computable ...
Jeffrey Shallit
doaj   +5 more sources

An Integrated Test Sequence Generation Method Based on Software Metrics [PDF]

open access: yesZhengzhou Daxue xuebao. Gongxue ban, 2021
To ensure that the software products could work as designed,a series of tests were needed.Due to the different importance of different modules,testers could have special requirements for test projects.How to help testers improve efficiency was the main ...
Fickxiong, Wang Yawen, Gongyun War
doaj   +1 more source

Hidden automatic sequences [PDF]

open access: yesCombinatorial Theory, 2021
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where an, a priori, morphic sequence with a \emph{non-uniform} morphism happens to be an automatic sequence.
Allouche, Jean-Paul   +2 more
openaire   +5 more sources

Multiplicative automatic sequences [PDF]

open access: yesMathematische Zeitschrift, 2021
AbstractWe obtain a complete classification of complex-valued sequences which are both multiplicative and automatic.
Jakub Konieczny   +2 more
openaire   +3 more sources

Formal inverses of the generalized Thue-Morse sequences and variations of the Rudin-Shapiro sequence [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
A formal inverse of a given automatic sequence (the sequence of coefficients of the composition inverse of its associated formal power series) is also automatic.
Łukasz Merta
doaj   +1 more source

Solutions of the Yang–Baxter Equation and Automaticity Related to Kronecker Modules

open access: yesComputation, 2023
The Kronecker algebra K is the path algebra induced by the quiver with two parallel arrows, one source and one sink (i.e., a quiver with two vertices and two arrows going in the same direction). Modules over K are said to be Kronecker modules.
Agustín Moreno Cañadas   +2 more
doaj   +1 more source

Complexity of automatic sequences

open access: yesInformation and Computation, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zantema, H., Bosma, W.
openaire   +3 more sources

Home - About - Disclaimer - Privacy