Zobrazeno 1 - 10
of 30
pro vyhledávání: '"omega-power"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Electronic Engineering Times (01921541). 07/27/98, Issue 1018, p116. 1/8p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Electronic Buyers' News. 04/27/98, Issue 1106, p40. 1/9p.
Autor:
Finkel, Olivier, Lecomte, Dominique
Publikováno v:
Annals of Pure and Applied Logic
Annals of Pure and Applied Logic, Elsevier Masson, 2009, 160 (2), pp.163-191
Annals of Pure and Applied Logic, 2009, 160 (2), pp.163-191
Annals of Pure and Applied Logic, Elsevier Masson, 2009, 160 (2), pp.163-191
Annals of Pure and Applied Logic, 2009, 160 (2), pp.163-191
We prove that, for each non null countable ordinal alpha, there exist some Sigma^0_alpha-complete omega-powers, and some Pi^0_alpha-complete omega-powers, extending previous works on the topological complexity of omega-powers. We prove effective vers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b63a8b9183da4e8f5f75c2b2fb276e1
https://hal-ens-lyon.archives-ouvertes.fr/ensl-00168644
https://hal-ens-lyon.archives-ouvertes.fr/ensl-00168644
Autor:
Duparc, Jacques, Finkel, Olivier
Publikováno v:
Proceedings of the International Conference on Foundations of the Formal Sciences V : Infinite Games
Foundations of the Formal Sciences V : Infinite Games, November 26-29, 2004
Foundations of the Formal Sciences V : Infinite Games, November 26-29, 2004, Bonn, Germany. pp.109-122
Foundations of the Formal Sciences V : Infinite Games, November 26-29, 2004
Foundations of the Formal Sciences V : Infinite Games, November 26-29, 2004, Bonn, Germany. pp.109-122
We use erasers-like basic operations on words to construct a set that is both Borel and above Delta^0_omega, built as a set V^\omega where V is a language of finite words accepted by a pushdown automaton. In particular, this gives a first example of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55faba7b7905598812c887444c1f1086
http://arxiv.org/abs/0801.1783
http://arxiv.org/abs/0801.1783
Autor:
Lecomte, Dominique
Publikováno v:
The Journal of Symbolic Logic
The Journal of Symbolic Logic, 2005, 70 (4), pp.1210-1232
The Journal of Symbolic Logic, Association for Symbolic Logic, 2005, 70 (4), pp.1210-1232
The Journal of Symbolic Logic, 2005, 70 (4), pp.1210-1232
The Journal of Symbolic Logic, Association for Symbolic Logic, 2005, 70 (4), pp.1210-1232
International audience; We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among other things, this gives some true co-analytic sets. The case where the di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc9bb8e7cb94391012082518353aa003
https://hal.science/hal-00175696
https://hal.science/hal-00175696