Avoidability index for binary patterns with reversal

Autor:	Philip Lafrance, James D. Currie
Jazyk:	angličtina
Rok vydání:	2017
Předmět:	FOS: Computer and information sciences Index (economics) Formal Languages and Automata Theory (cs.FL) Applied Mathematics Binary number Computer Science - Formal Languages and Automata Theory 68R15 0102 computer and information sciences 02 engineering and technology combinatorics on words words avoiding patterns patterns with reversal 01 natural sciences Theoretical Computer Science Combinatorics Combinatorics on words Computational Theory and Mathematics 010201 computation theory & mathematics FOS: Mathematics 0202 electrical engineering electronic engineering information engineering Mathematics - Combinatorics Discrete Mathematics and Combinatorics 020201 artificial intelligence & image processing Combinatorics (math.CO) Geometry and Topology Alphabet Mathematics
Popis:	For every pattern $p$ over the alphabet $\{x,y,x^R,y^R\}$, we specify the least $k$ such that $p$ is $k$-avoidable. Comment: 15 pages, 1 figure
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43270120564b313046d74d0f334c70fb https://hdl.handle.net/10680/1754 Zobrazit plný text záznamu