Abstract
We consider the set ℝω(Γ, D) of infinite real traces, over a dependence alphabet (Γ,D) with no isolated letter, equipped with the topology induced by the prefix metric. We prove that all rational languages of infinite real traces are analytic sets. We also reprove that there exist some rational languages of infinite real traces that are analytic but non-Borel sets; in fact, these sets are even Σ 11 -complete, hence have maximum possible topological complexity. For this purpose, we give an example of a Σ 11 -complete language that is fundamentally different from the known example of a Σ 11 -complete infinitary rational relation given by Finkel (2003). Bibliography: 35 titles.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
X. Augros, “Des algorithmes autour des codes rationnels,” Ph.D. Thesis, Université de Nice-Sophia Antipolis, Nice (2001
M. K. Ahmad and X. Augros, “Some results on codes for generalized factorizations,” J. Autom. Lang. Comb., 6, No. 3, 239–251 (200
J.-H. Altenbernd, W. Thomas, and S. Wöhrle, “Tiling systems over infinite pictures and their acceptance conditions,” Lect. Notes Comput. Sci., 2450, 297–306 (200
P. Bonnizzoni, G. Mauri, and G. Pighizzini, “About infinite traces,” in: Proceedings of the ASMICS Workshop on Free Partially Commutative Monoids, V. Diekert (ed.), Report TUM-I9002, Technischen Universität München (1990), pp. 1–10.
P. Cartier and D. Foata, Problèmes Combinatoires de Commutation et de Réarrangements, Springer-Verlag, Berlin—Heidelberg—New York (1969).
V. Diekert and G. Rozenberg (eds.), The Book of Traces, World Scientific, Singapore (1995).
O. Finkel, “Topological properties of omega context free languages,” Theoret. Comput. Sci., 262, No. 1–2, 669–697 (200
O. Finkel, “Borel hierarchy and omega context free languages,” Theoret. Comput. Sci., 290, No. 3, 1385–1405 (200
O. Finkel, “Ambiguity in omega context free languages.” Theoret. Comput. Sci., 301, No. 1–3, 217–270 (200
O. Finkel, “On the topological complexity of infinitary rational relations,” Theor. Inform. Appl., 37, No. 2, 105–113 (200
O. Finkel, “Undecidability of topological and arithmetical properties of infinitary rational relations,” Theor. Inform. Appl., 37, No. 2, 115–126 (200
O. Finkel and P. Simonnet, “Topology and ambiguity in omega context free languages,” Bull. Belg. Math. Soc., 10, No. 5, 707–722 (200
O. Finkel, “On recognizable languages of infinite pictures,” Internat. J. Found. Comput. Sci., 15, No. 6, 823–840 (200
O. Finkel, “An ω-power of a finitary language which is a Borel set of infinite rank,” Fund. Inform., 62, No. 3–4, 333–342 (200
P. Gastin, “Recognizable and rational languages of finite and infinite traces,” Lect. Notes Comput. Sci., 480, 89–104 (199
P. Gastin and A. Petit, “G. Rozenberg (eds.), World Scientific, Singapore (1995), pp. 393–
P. Gastin, A. Petit, and W. Zielonka, “An extension of Kleene’s and Ochmanski’s theorems to infinite traces,” Theoret. Comput. Sci., 125, 167–204 (199
H. J. Hoogeboom and A. Muscholl, “The code problem for traces — improving the boundaries,” Theoret. Comput. Sci., 172, 309–321 (199
A. S. Kechris, Classical Descriptive Set Theory, Springer-Verlag, New York (1995).
R. Kummetz and D. Kuske, “The topology of Mazurkiewicz traces,” Theoret. Comput. Sci., 305, No. 1–3, 237–258 (200
M. Kwiatkowska, “A metric for traces,” Inform. Process. Lett., 35, 129–135 (199
L. H. Landweber, “Decision problems for ω-automata,” Math. Systems Theory, 3, No. 4, 376–384 (196
D. Lecomte, “Sur les ensembles de phrases infinies constructibles a partir d’un dictionnaire sur un alphabet fini,” Séminaire d’Initiation à l’Analyse, 1 (2001–20
H. Lescow and W. Thomas, “Logical specifications of infinite computations,” Lect. Notes. Comput. Sci., 803, 583–621 (199
A. Mazurkiewicz, “Concurrent programs schemes and their interpretation,” DAIMI Report PB-78, Aarhus University, Aarhus (19
Y. N. Moschovakis, Descriptive Set Theory, Amsterdam, North-Holland (1980).
D. Niwinski, “An example of non Borel set of infinite trees recognizable by a Rabin automaton,” Manuscript, University of Warsaw (1985
D. Niwinski, Problem on ω-powers, posed in: Proceedings of the 1990 Workshop “Logics and Recognizable Sets,” Universität Kiel (1990
D. Perrin and J.-E. Pin, Infinite Words, Automata, Semigroups, Logic and Games, Elsevier (2004).
P. Simonnet, “Automates et théorie descriptive,” Ph. D. Thesis, Université Paris 7, Paris (1992
P. Simonnet, “Automate d’arbres infinis et choix borélien,” C. R. Acad. Sci. Paris, 316, No. 1, 97–100 (199
L. Staiger, “Hierarchies of recursive ω-languages,” J. Inform. Process. Cybernet., 22, No. 5/6, 219–241 (198
L. Staiger, “A. Salomaa (eds.), Springer-Verlag, Berlin (199
L. Staiger, “On ω-power languages,” Lect. Notes Comput. Sci., 1218, 377–393 (199
W. Thomas, “Automata on infinite objects,” in: Handbook of Theoretical Computer Science, Vol. B, J.Van Leeuwen (ed.), Elsevier,Amsterdam (1990), pp. 133–
Author information
Authors and Affiliations
Additional information
Published in Zapiski Nauchnykh Seminarov POMI, Vol. 316, 2004, pp. 205–223.
Rights and permissions
About this article
Cite this article
Finkel, O., Ressayre, JP. & Simonnet, P. On infinite real trace rational languages of maximum topological complexity. J Math Sci 134, 2435–2444 (2006). https://doi.org/10.1007/s10958-006-0120-z
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10958-006-0120-z