Copyright © 2003 Elsevier B.V. All rights reserved.
Well-quasi-orders and regular ω-languages
Available online 8 April 2004.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In “On regularity of context-free languages” [Theoret. Comput. Sci. 27 (1983) 311], Ehrenfeucht et al. showed that a set L of finite words is regular if and only if L is
-closed under some monotone well-quasi-order (WQO)
over finite words. We extend this result to regular ω-languages. That is,
- (1) an ω-language L is regular if and only if L is
-closed under a periodic extension
of some monotone WQO over finite words, and - (2) an ω-language L is regular if and only if L is
-closed under a WQO
over ω-words that is a continuous extension of some monotone WQO over finite words.
Author Keywords: ω-language; Well-quasi-order; Regularity







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)

), the algebraic compositions being given by





