Results 21 to 30 of about 593 (116)
Standard factors of sturmian words [PDF]
RAIRO - Theoretical Informatics and Applications, 2010 International audienceAmong the various ways to construct a characteristic Sturmian word, one of the most used consists in defining an infinite sequence of prefixes that are standard.
Luca Q. Zamboni +5 more
core +4 more sources
Complementary symmetric Rote sequences: the critical exponent and the recurrence function [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We determine the critical exponent and the recurrence function of complementary symmetric Rote sequences. The formulae are expressed in terms of the continued fraction expansions associated with the S-adic representations of the corresponding standard ...
Lubomíra Dvořáková +2 more
doaj +1 more source
Decimations and sturmian words [PDF]
RAIRO - Theoretical Informatics and Applications, 1997 Summary: Standard Sturmian infinite words have a curious property discovered by G. Rauzy. If in such a word we delete all occurrences of each letter, except every \(p\)th one, then we get the some infinite word. This property and several generalizations are studied here.
Jacques Justin, Giuseppe Pirillo
openaire +2 more sources
A Classification of Trapezoidal Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A trapezoidal word
Gabriele Fici
doaj +1 more source
Novel Stream Ciphering Algorithm for Big Data Images Using Zeckendorf Representation
Wireless Communications and Mobile Computing, Volume 2021, Issue 1, 2021., 2021 Big data is a term used for very large data sets. Digital equipment produces vast amounts of images every day; the need for image encryption is increasingly pronounced, for example, to safeguard the privacy of the patients’ medical imaging data in cloud disk.
Liangshun Wu, Hengjin Cai, Rajesh Kaluri
wiley +1 more source
A geometrical approach of palindromic factors of standard billiard words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Many results are already known, concerning the palindromic factors and the palindomic prefixes of Standard billiard words, i.e., Sturmian words and billiard words in any dimension, starting at the origin.
Jean-Pierre Borel
doaj +1 more source
Hopcroft's automaton minimization algorithm and Sturmian words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 This paper is concerned with the analysis of the worst case behavior of Hopcroft's algorithm for minimizing deterministic finite state automata. We extend a result of Castiglione, Restivo and Sciortino.
Jean Berstel +2 more
doaj +1 more source
Permutation Complexity Related to the Letter Doubling Map [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, π, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural numbers associated ...
Steven Widmer
doaj +1 more source
Permutation complexity of images of Sturmian words by marked morphisms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is $n+k$ for some constant $k$ and all lengths $n$ sufficiently large.
Adam Borchert, Narad Rampersad
doaj +1 more source
A remark on morphic sturmian words [PDF]
RAIRO - Theoretical Informatics and Applications, 1994 Summary: This note deals with binary Sturmian words that are morphic, i.e. generated by iterating a morphism. Among these, characteristic words are a well-known subclass. We prove that for every characteristic morphic word \(x\), the four words \(ax\), \(bx\), \(abx\) and \(bax\) are morphic.
Berstel, Jean, Séébold, Patrice
openaire +2 more sources