Results 141 to 150 of about 1,252 (172)

Optimal positioning and size of high-density electrocorticography grids for speech brain-computer interfaces

open access: yes
Offenberg EC   +5 more
europepmc   +1 more source

Parameterized Metrics and Their Applications in Word Combinatorics

Communications in Computer and Information Science, 2022
Raivis Bets   +2 more
exaly   +2 more sources

Combinatorics on Words

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

ALGORITHMIC COMBINATORICS ON PARTIAL WORDS

International Journal of Foundations of Computer Science, 2012
Algorithmic 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

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

Review of applied combinatorics on words

ACM SIGACT News, 2008
Text 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

Formalizing a Fragment of Combinatorics on Words

2017
We 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

Combinatorics on Words

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

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

Home - About - Disclaimer - Privacy