Results 151 to 160 of about 73,517 (203)

A Complete Energy Model for Graphene Flake Growth with the Fewest Possible Dangling Bonds. [PDF]

open access: yesNanomaterials (Basel)
Grozev IG   +6 more
europepmc   +1 more source

Combinatorics on Words

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 ...
T. Harju
openaire   +2 more sources

Naming and ordering the modes, in light of combinatorics on words

Journal of Mathematics and Music, 2018
One of the most telling features of the application of combinatorics on words in mathematical music theory is the extent to which aspects of the history of theory are captured by the word theory model.
David Clampitt, T. Noll
semanticscholar   +3 more sources

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
M. Lothaire
openaire   +3 more sources

Combinatorics on words and generating Dirichlet series of automatic sequences

Discrete Mathematics
Generating 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 ...
J. Allouche   +2 more
semanticscholar   +3 more sources

Home - About - Disclaimer - Privacy