On Words with the Zero Palindromic Defect
This work focuses on description of pairs of rich words which cannot occur simultaneously as factors of a longer rich word in the set of finite words with zero palindromic defect, i.e., words rich inPalindromes.
Conferences WORDS, years 1997-2017: Open Problems and Conjectures
- MathematicsBull. EATCS
In connection with the development of the field of Combinatorics on Words, we present a list of open problems and conjectures which were stated in the context of the eleven international meetings…
Bifix codes, Combinatorics on Words and Symbolic Dynamical Systems. (Codes bifixes, combinatoire des mots et systèmes dynamiques symboliques)
This thesis presents several classes of sets of words defined by the possible shapes that the graphs of elements in the set can have, and proves several results concerning closure properties, cardinality of the bifix codes and set of return words in these sets, connection between return words and basis of the free groups, as well as between b crucifix codes and subgroup of thefree group.
The Formal Language Theory Column
- Computer Science
This work states that by suitably restricting more general models such as context-free grammars, pushdown automata, and Turing machines, that characterize wider classes of languages, it is possible to obtain formal models that generate or recognize regular languages only.
Technical Report Column
- Computer ScienceSIGA
Improved concrete efficiency and security analysis of Reed-Solomon PCPPs and Randomized query complexity of sabotaged and composed functions, Shalev Ben-David, Robin Kothari, TR16-087.
SHOWING 1-10 OF 31 REFERENCES
A Counterexample to a Question of Hof, Knill and Simon
- MathematicsElectron. J. Comb.
A negative answer is given to a question of Hof, Knill and Simon (1995) concerning purely morphic sequences obtained from primitive morphism containing an infinite number of palindromes about the existence of a counterexample on the ternary alphabet.
On The Palindromic Complexity Of Infinite Words
- MathematicsInt. J. Found. Comput. Sci.
It is proved that there exist periodic words having the maximum number of palindromes as in the case of Sturmian words, by providing a simple and easy to check condition.
Combinatorial properties of f-palindromes in the Thue-Morse sequence ∗
The palindromic defect of a finite word w is defined as D(w) = |w|+ 1 − |Pal(w)| where Pal(w) is the set of its palindromic factors. In this paper we study the problem of computing the palindromic…
Palindromic sequences generated from marked morphisms
- MathematicsEur. J. Comb.
Exchange of three intervals: Substitutions and palindromicity
- MathematicsEur. J. Comb.
A connection between palindromic and factor complexity using return words
- MathematicsAdv. Appl. Math.
Mirror substitutions and palindromic sequences
By introducing the notion of mirror substitution, we show that, given a substitutive sequence over two letters, it is palindromic (that is, it contains arbitrarily long palindromes) if and only if…
Exchange of three intervals: itineraries, substitutions and palindromicity
Given a symmetric exchange of three intervals, we provide a detailed description of the return times to a subinterval and the corresponding itineraries. We apply our results to morphisms fixing words…
Episturmian words and some constructions of de Luca and Rauzy
- MathematicsTheor. Comput. Sci.