ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Theoretical Computer Science
Volume 324, Issue 1, 16 September 2004, Pages 55-60
Words, Languages and Combinatorics
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (195 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.tcs.2004.03.052    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Elsevier B.V. All rights reserved.

Well-quasi-orders and regular ω-languages

Mizuhito OgawaE-mail The Corresponding Author

Japan Advanced Institute of Science and Technology, 1-1 Asahidai Tatsunokuchi, Nomi, Ishikawa 923-1292, Japan

Available online 8 April 2004.

Purchase the full-text article



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 less-than-or-equals, slant-closed under some monotone well-quasi-order (WQO) less-than-or-equals, slant over finite words. We extend this result to regular ω-languages. That is,

(1) an ω-language L is regular if and only if L is precedes or equal to-closed under a periodic extension precedes or equal to of some monotone WQO over finite words, and
(2) an ω-language L is regular if and only if L is precedes or equal to-closed under a WQO precedes or equal to over ω-words that is a continuous extension of some monotone WQO over finite words.

Author Keywords: ω-language; Well-quasi-order; Regularity

Article Outline

• References

Theoretical Computer Science
Volume 324, Issue 1, 16 September 2004, Pages 55-60
Words, Languages and Combinatorics
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.