Stepan Holub and Robert Veroff – Formalizing a Fragment of Combinatorics on Words
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.
Pascal Ochem – Pattern avoidance
We survey the constructive and non-constructive methods for the existence of infinite words avoiding a pattern. We also make several remarks about pattern avoidance in general that are more or less related to the question whether the avoidability index of a pattern is computable.
Svetlana Puzynina – On variations of Morse and Hedlund theorem
In this talk we discuss generalizations of the Morse-Hedlund theorem and present a concept of words complexity via group actions.
Narad Rampersad – Formulas with reversal
We introduce the new concept of “formula with reversal”. We show some simple formulas with reversal that have high index and we give a partial characterization of unavoidable formulas with reversal.