A classification of \(\omega\)-regular languages
type: Item
instance of: scholarly article
title: A classification of \(\omega\)-regular languages
zbMATH Open document ID: 0565.68076
DOI: 10.1016/0304-3975(85)90043-X
author: Michael Kaminski
published in: Theoretical Computer Science
publication date: 1985-01-01T00:00:00Z
review text: For a given \(\omega\)-regular language A we establish an invariant property of the structure of finite automata which accept A.
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3902069
zbMATH Keywords: omega-regular language
zbMATH Keywords: finite automata
MaRDI profile type: Publication
cites work: Q5525343
cites work: Theories of automata on \(\omega\)-tapes: a simplified approach
cites work: Sets of Numbers Defined by Finite Automata
cites work: Decision problems forω-automata
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Q4074888
cites work: A note on \(\omega\)-regular languages
Recommended article: Mathematical Foundations of Computer Science 2004
Recommended article: Extensions of ω-Regular Languages
Recommended article: Beyond $\omega$-Regular Languages
Recommended article: Fine hierarchy of regular ω-languages
Recommended article: Fine hierarchy of regular \(\omega\)-languages
Recommended article: Characterization of \(\omega\)-regular languages by first-order formulas
Recommended article: Inferring regular languages and \(\omega\)-languages
Recommended article: FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
Recommended article: Fine Hierarchy of Regular Aperiodic ω-Languages
Recommended article: Q4941145
description: scientific article; zbMATH DE number 3902069