An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2

Autor:	Julien Leroy
Jazyk:	angličtina
Rok vydání:	2014
Předmět:	special factor factor complexity s-adic conjecture rauzy graph s-adic subshift [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] Mathematics QA1-939
Zdroj:	Discrete Mathematics & Theoretical Computer Science, Vol Vol. 16 no. 1, Iss Automata, Logic and Semantics (2014)
Druh dokumentu:	article
ISSN:	1365-8050
DOI:	10.46298/dmtcs.1249
Popis:	Automata, Logic and Semantics
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/a4445f9bd4424114a5f5624827f07c4d Zobrazit plný text záznamu View record in DOAJ