Inventories of unavoidable languages and the word-extension conjecture
type: Item
instance of: scholarly article
title: Inventories of unavoidable languages and the word-extension conjecture
zbMATH Open document ID: 0902.68099
DOI: 10.1016/S0304-3975(97)00031-5
author: Laurent Rosaz
published in: Theoretical Computer Science
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D40
zbMATH DE Number: 1190160
zbMATH Keywords: unavoidable languages
Wikidata QID: Q123267438
MaRDI profile type: Publication
cites work: Efficient string matching
cites work: Avoidable patterns in strings of symbols
cites work: Q3687737
cites work: On extendibility of unavoidable sets
cites work: An optimal test on finite unavoidable sets of words
cites work: On regularity of context-free languages
cites work: Uniqueness Theorems for Periodic Functions
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
cites work: The theory of well-quasi-ordering: a frequently discovered concept
cites work: Q3853827
cites work: Q2704225
cites work: Q3659988
cites work: Inevitability in concurrent systems
cites work: Using unavoidable set of trees to generalize Kruskal's theorem
cites work: Unavoidable languages, cuts and innocent sets of words
cites work: On the synchronizing properties of certain prefix codes
description: scientific article; zbMATH DE number 1190160