Results 161 to 170 of about 73,517 (203)
Some of the next articles are maybe not open access.
ALGORITHMIC COMBINATORICS ON PARTIAL WORDS
International Journal of Foundations of Computer Science, 2012Algorithmic combinatorics on partial words, or sequences of symbols over a finite alphabet that may have some do-not-know symbols or holes, has been developing in the past few years. Applications can be found, for instance, in molecular biology for the sequencing and analysis of DNA, in bio-inspired computing where partial words have been considered ...
openaire +4 more sources
Aperiodic engineering from combinatorics on words
The Mathematical GazetteThe recent discovery of the aperiodic monotiles known as the hat and the spectre has sparked a surge of interest by the general public in exactly what it means to tile the Euclidean plane in an aperiodic fashion.
M. Hansen
openaire +2 more sources
TCS special issue: Combinatorics on Words – WORDS 2021
Theoretical Computer Science, 2023Thierry Lecroq, Svetlana Puzynina
openaire +2 more sources
The combinatorics of Farey words and their traces
Groups, Geometry, and Dynamics, 2022We introduce a family of 3 -variable ‘Farey polynomials’ that are closely connected with the geometry and topology of 3 -manifolds and orbifolds as they can be used to produce concrete realisations of the boundaries and local coordinates ...
Alexander Elzenaar +2 more
semanticscholar +1 more source
Group Actions and Some Combinatorics on Words with vtm
arXiv.orgWe introduce generalizations of powers and factor complexity via orbits of group actions. These generalizations include concepts like abelian powers and abelian complexity.
J. Machacek
semanticscholar +1 more source
1999
The combinatorics of finite, as well as infinite, sequences of symbols (words) over a finite set can be considered at the present time as an independent mathematical topic which has arisen in such diverse fields as logic, algebra, physics, computer science, and, more recently, biology.
Aldo de Luca, Stefano Varricchio
openaire +1 more source
The combinatorics of finite, as well as infinite, sequences of symbols (words) over a finite set can be considered at the present time as an independent mathematical topic which has arisen in such diverse fields as logic, algebra, physics, computer science, and, more recently, biology.
Aldo de Luca, Stefano Varricchio
openaire +1 more source
1997
Combinatorics on words, or finite sequences, is a field which grew simultaneously within disparate branches of mathematics such as group theory and probability. It has grown into an independent theory finding substantial applications in computer science automata theory and linguistics. This volume is the first to attempt to present a thorough treatment
openaire +1 more source
Combinatorics on words, or finite sequences, is a field which grew simultaneously within disparate branches of mathematics such as group theory and probability. It has grown into an independent theory finding substantial applications in computer science automata theory and linguistics. This volume is the first to attempt to present a thorough treatment
openaire +1 more source