By applying descriptive set theory we get several facts on the fine structure of regular ω-languages considered by K.Wagner. We present quite different, shorter proofs for main his results and get new results. Our description of the fine structure is new, very clear and automata-free. We prove also a closure property of the fine structure under Boolean operations. Our results demonstrate deep interconnections between descriptive set theory and theory of ω-languages.
Original languageEnglish
Title of host publicationTAPSOFT '95: Theory and Practice of Software Development (CAAP 1995)
Pages277-287
Number of pages11
DOIs
StatePublished - 1 Jan 1995
EventTAPSOFT-1995 -
Duration: 22 May 1995 → …

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Nature
Volume915
ISSN (Print)0302-9743

Conference

ConferenceTAPSOFT-1995
Period22/05/95 → …

ID: 127141657