Standard

Fine hierarchy of regular ω-languages. / Selivanov, Victor.

In: Theoretical Computer Science, Vol. 191, No. 1-2, 30.01.1998, p. 37-59.

Research output: Contribution to journal › Article › peer-review

Harvard

Selivanov, V 1998, 'Fine hierarchy of regular ω-languages', Theoretical Computer Science, vol. 191, no. 1-2, pp. 37-59. https://doi.org/10.1016/S0304-3975(97)00301-0

APA

Selivanov, V. (1998). Fine hierarchy of regular ω-languages. Theoretical Computer Science, 191(1-2), 37-59. https://doi.org/10.1016/S0304-3975(97)00301-0

Vancouver

Selivanov V. Fine hierarchy of regular ω-languages. Theoretical Computer Science. 1998 Jan 30;191(1-2):37-59. https://doi.org/10.1016/S0304-3975(97)00301-0

Author

Selivanov, Victor. / Fine hierarchy of regular ω-languages. In: Theoretical Computer Science. 1998 ; Vol. 191, No. 1-2. pp. 37-59.

BibTeX

@article{e7aa4c19b1374948873849efed9dd5c5,
title = "Fine hierarchy of regular ω-languages",
abstract = "By applying descriptive set theory to the Wagner's fine structure of regular ω-languages we get quite different proofs of his results and obtain new results. We give an automata-free description of the fine structure. We present also a simple property of a deterministic Muller automaton equivalent to the condition that the corresponding regular ω-language belongs to any given level of the fine structure. Our results and proofs demonstrate deep interconnections between descriptive set theory and the theory of ω-languages.",
author = "Victor Selivanov",
year = "1998",
month = jan,
day = "30",
doi = "10.1016/S0304-3975(97)00301-0",
language = "English",
volume = "191",
pages = "37--59",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-2",

}

RIS

TY - JOUR

T1 - Fine hierarchy of regular ω-languages

AU - Selivanov, Victor

PY - 1998/1/30

Y1 - 1998/1/30

N2 - By applying descriptive set theory to the Wagner's fine structure of regular ω-languages we get quite different proofs of his results and obtain new results. We give an automata-free description of the fine structure. We present also a simple property of a deterministic Muller automaton equivalent to the condition that the corresponding regular ω-language belongs to any given level of the fine structure. Our results and proofs demonstrate deep interconnections between descriptive set theory and the theory of ω-languages.

AB - By applying descriptive set theory to the Wagner's fine structure of regular ω-languages we get quite different proofs of his results and obtain new results. We give an automata-free description of the fine structure. We present also a simple property of a deterministic Muller automaton equivalent to the condition that the corresponding regular ω-language belongs to any given level of the fine structure. Our results and proofs demonstrate deep interconnections between descriptive set theory and the theory of ω-languages.

UR - http://www.scopus.com/inward/record.url?scp=0003018677&partnerID=8YFLogxK

U2 - 10.1016/S0304-3975(97)00301-0

DO - 10.1016/S0304-3975(97)00301-0

M3 - Article

AN - SCOPUS:0003018677

VL - 191

SP - 37

EP - 59

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -

ID: 127141414