Abstract<\/strong>: Abstract<\/strong>: Abstract<\/strong>: Abstract<\/strong>: Stepan Holub and Robert Veroff – Formalizing a Fragment of Combinatorics on Words Abstract: 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 Abstract: We survey the constructive and non-constructive methods for the … Continue reading Combinatorics and algorithmics on words<\/span>
\nWe 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.<\/em><\/p>\nPascal Ochem – Pattern avoidance<\/h5>\n
\nWe 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.<\/em><\/p>\nSvetlana Puzynina – On variations of Morse and Hedlund theorem<\/h5>\n
\nIn this talk we discuss generalizations of the Morse-Hedlund theorem and present a concept of words complexity via group actions.<\/em><\/p>\nNarad Rampersad – Formulas with reversal<\/h5>\n
\nWe 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.<\/em><\/p>\n","protected":false},"excerpt":{"rendered":"