Results 121 to 130 of about 70,377,857 (147)
Some of the next articles are maybe not open access.
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
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 +2 more sources
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
Structure, Combinatorics, and Complexity of “Words”
2006Eduardo Caianiello was an eminent scientist in various fields including Physics and Cybernetics. I met him for the first time at the beginning of the 1960s as a student of his course on Theoretical Physics and I was tremendously impressed by his towering personality. In 1964, I became a member of the Group of Cybernetics at the Institute of Theoretical
openaire +2 more sources
Combinatorics of Finite Words and Suffix Automata
2009The suffix automaton of a finite word is the minimal deterministic automaton accepting the language of its suffixes. The states of the suffix automaton are the classes of an equivalence relation defined on the set of factors. We explore the relationship between the combinatorial properties of a finite word and the structural properties of its suffix ...
openaire +3 more sources