Results 181 to 190 of about 2,178 (219)
Some of the next articles are maybe not open access.
Parameterized Metrics and Their Applications in Word Combinatorics
Communications in Computer and Information Science, 2022Alexander Sostaks +2 more
exaly +2 more sources
Combinatorics of Compositions and Words [PDF]
, 2009 A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel Research Directions Focusing on a very active area of research in the last decade, Combinatorics of Compositions and Words provides an introduction to the methods used
Silvia Heubach, Toufik Mansour
openaire +2 more sources
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
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 +2 more sources
Combinatorics on words and generating Dirichlet series of automatic sequences [PDF]
Discrete MathematicsGenerating series are crucial in enumerative combinatorics, analytic combinatorics, and combinatorics on words. Though it might seem at first view that generating Dirichlet series are less used in these fields than ordinary and exponential generating ...
Manon Stipulanti +2 more
exaly +2 more sources
Formalizing a Fragment of Combinatorics on Words
2017We describe an attempt to formalize some tasks in combinatorics on words using the assistance of Prover9, an automated theorem prover for first-order and equational logic.
Stepan Holub, Robert Veroff
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
Review of applied combinatorics on words
ACM SIGACT News, 2008Text manipulations play an important part in various kinds of computations. The subject of text manipulations, is a well developed subject in computer science. The book deals with algorithms, and theoretical properties of texts. Most of algorithms are expressed in pseudo code. They are accompanied by their proofs of correctness, and complexity analysis.
openaire +1 more source
2004
Words (strings of symbols) are fundamental in computer processing. Indeed, each bit of data processed by a computer is a string, and nearly all computer software use algorithms on strings. There are also abundant supply of applications of these algorithms in other areas such as data compression, DNA sequence analysis, computer graphics, cryptography ...
openaire +1 more source
Words (strings of symbols) are fundamental in computer processing. Indeed, each bit of data processed by a computer is a string, and nearly all computer software use algorithms on strings. There are also abundant supply of applications of these algorithms in other areas such as data compression, DNA sequence analysis, computer graphics, cryptography ...
openaire +1 more source
Combinatorics on Infinite Words
2004We consider several problems of infinite words over a finite alphabet. In particular, we describe a few automata-theoretic methods to define infinite words. Properties of infinite words studied in more details are repetition-freeness, periodicity and different kinds of complexity issues.
Juhani Karhumäki, Arto Lepistö
openaire +1 more source