Standard

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

TAPSOFT '95: Theory and Practice of Software Development (CAAP 1995). 1995. p. 277-287 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 915).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Selivanov, V 1995, Fine hierarchy of regular ω-languages. in TAPSOFT '95: Theory and Practice of Software Development (CAAP 1995). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 915, pp. 277-287, TAPSOFT-1995, 22/05/95. https://doi.org/10.1007/3-540-59293-8_201

APA

Selivanov, V. (1995). Fine hierarchy of regular ω-languages. In TAPSOFT '95: Theory and Practice of Software Development (CAAP 1995) (pp. 277-287). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 915). https://doi.org/10.1007/3-540-59293-8_201

Vancouver

Selivanov V. Fine hierarchy of regular ω-languages. In TAPSOFT '95: Theory and Practice of Software Development (CAAP 1995). 1995. p. 277-287. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-59293-8_201

Author

Selivanov, Victor. / Fine hierarchy of regular ω-languages. TAPSOFT '95: Theory and Practice of Software Development (CAAP 1995). 1995. pp. 277-287 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{40a53989bfca46a6b46a7d3435225dcc,
title = "Fine hierarchy of regular ω-languages",
abstract = "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.",
author = "Victor Selivanov",
year = "1995",
month = jan,
day = "1",
doi = "10.1007/3-540-59293-8_201",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "277--287",
booktitle = "TAPSOFT '95: Theory and Practice of Software Development (CAAP 1995)",
note = "TAPSOFT-1995 ; Conference date: 22-05-1995",

}

RIS

TY - GEN

T1 - Fine hierarchy of regular ω-languages

AU - Selivanov, Victor

PY - 1995/1/1

Y1 - 1995/1/1

N2 - 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.

AB - 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.

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

U2 - 10.1007/3-540-59293-8_201

DO - 10.1007/3-540-59293-8_201

M3 - Conference contribution

AN - SCOPUS:21844524187

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 277

EP - 287

BT - TAPSOFT '95: Theory and Practice of Software Development (CAAP 1995)

T2 - TAPSOFT-1995

Y2 - 22 May 1995

ER -

ID: 127141657