Well quasi-orders and context-free grammars
type: Item
instance of: scholarly article
title: Well quasi-orders and context-free grammars
zbMATH Open document ID: 1071.68033
author: Flavio D'Alessandro
author: Stefano Varricchio
published in: Theoretical Computer Science
publication date: 2005-01-11T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 2126128
zbMATH Keywords: Well quasi-orders
zbMATH Keywords: Context-free grammars
zbMATH Keywords: Unavoidable sets of words
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.03.069
OpenAlex ID: W2003401299
cites work: Q3859267
cites work: On the regularity of languages on a binary alphabet generated by copying systems
cites work: Well quasi-orders and regular languages
cites work: Q4231020
cites work: On regularity of context-free languages
cites work: On quasi orders of words and the confluence property
cites work: Another generalization of Higman's well quasi order result on \(\Sigma ^*\)
cites work: Ordering by Divisibility in Abstract Algebras
cites work: On well quasi orders of free monoids
cites work: On the generalization of Higman and Kruskal's theorems to regular languages and rational trees
cites work: The theory of well-quasi-ordering: a frequently discovered concept
DOI: 10.1016/J.TCS.2004.03.069
description: scientific article; zbMATH DE number 2126128