Growth of power-free languages over large alphabets
type: Item
instance of: scholarly article
title: Growth of power-free languages over large alphabets
zbMATH Open document ID: 1380.68259
author: Arseny M. Shur
published in: Theory of Computing Systems
publication date: 2017-11-07T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6803495
zbMATH Keywords: formal languages
zbMATH Keywords: power-free languages
zbMATH Keywords: finite automata
zbMATH Keywords: growth rate
MaRDI profile type: Publication
full work available at URL: s00224-013-9512-x
OpenAlex ID: W2064854081
cites work: Growth of repetition-free words -- a review
cites work: Q3395963
cites work: Uniformly growing k-th power-free homomorphisms
cites work: On Dejean's conjecture over large alphabets
cites work: Automata and forbidden words
cites work: Dejean's conjecture holds for N ≥ 27
cites work: A proof of Dejean’s conjecture
cites work: Q4327350
cites work: Sur un théorème de Thue
cites work: Q3254327
cites work: Q3659988
cites work: Symbolic Dynamics
cites work: Last cases of Dejean's conjecture
cites work: Comparing Complexity Functions of a Language and Its Extendable Part
cites work: Combinatorial Complexity of Regular Languages
cites work: Growth rates of complexity of power-free languages
cites work: Two-Sided Bounds for the Growth Rates of Power-Free Languages
cites work: On the Existence of Minimal β-Powers
cites work: On the growth rates of complexity of threshold languages
DOI: 10.1007/S00224-013-9512-X
description: scientific article; zbMATH DE number 6803495