Well-quasi-orders and regular \(\omega\)-languages
type: Item
instance of: scholarly article
title: Well-quasi-orders and regular \(\omega\)-languages
zbMATH Open document ID: 1105.68065
author: Mizuhito Ogawa
published in: Theoretical Computer Science
publication date: 2004-10-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2105269
zbMATH Keywords: \(\omega\)-language
zbMATH Keywords: Well-quasi-order
zbMATH Keywords: Regularity
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.03.052
OpenAlex ID: W2110251524
cites work: A syntactic congruence for rational \(\omega\)-languages
cites work: On regularity of context-free languages
cites work: Q4385530
DOI: 10.1016/J.TCS.2004.03.052
Recommended article: Well quasi-orders and regular languages
Recommended article: Q4452065
Recommended article: Well Quasi-orders in Formal Language Theory
Recommended article: On well quasiordering of finite languages
Recommended article: Regular solutions of language inequalities and well quasi-orders
Recommended article: Automata, Languages and Programming
Recommended article: Well quasi ordering finite posets and formal languages
Recommended article: Well quasi-orders and context-free grammars
Recommended article: Fine hierarchy of regular ω-languages
Recommended article: Fine hierarchy of regular \(\omega\)-languages
description: scientific article; zbMATH DE number 2105269