Results 111 to 120 of about 67,579,596 (150)
Algebraic Combinatorics on Words
, 2002 Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's book Combinatorics on Words. Originally published in 2002, this book
Lothaire, M, Lothaire, M.
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Formalizing a Fragment of Combinatorics on Words
Lecture Notes in Computer Science, 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.
Stepán Holub, Robert Veroff
exaly +2 more sources
Enumerative combinatorics on words
, 2015 Combinatorics on words is a field which has both historical roots and a substantial growth. Its roots are to be found in the early results of Axel Thue on square free words and the development of combinatorial group theory. The present interest in the field is pushed by its links with several connexions with other topics external to pure mathematics ...
Perrin, Dominique, Restivo, Antonio
core +5 more sources
Combinatorics, Words and Symbolic Dynamics
, 2016 Internationally recognised researchers look at developing trends in combinatorics with applications in the study of words and in symbolic dynamics. They explain the important concepts, providing a clear exposition of some recent results, and emphasise ...
exaly +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
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
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
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
Combinatorics of Compositions and Words
, 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
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 +2 more sources