Results 121 to 130 of about 67,579,596 (150)
Some of the next articles are maybe not open access.
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
Combinatorics of minimal absent words for a sliding window
Theoretical Computer Science, 2022Yuto Nakashima +2 more
exaly
Combinatorics of words and morphisms in some pieces of Tom Johnson
Journal of Mathematics and Music, 2018Jean-Paul Allouche
exaly