Skip to main content

2020 | OriginalPaper | Buchkapitel

The Automatic Baire Property and an Effective Property of \(\omega \)-Rational Functions

verfasst von : Olivier Finkel

Erschienen in: Language and Automata Theory and Applications

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We prove that \(\omega \)-regular languages accepted by Büchi or Muller automata satisfy an effective automata-theoretic version of the Baire property. Then we use this result to obtain a new effective property of rational functions over infinite words which are realized by finite state Büchi transducers: for each such function \(F: \mathsf {\Sigma }^\omega \rightarrow \mathsf {\Gamma }^\omega \), one can construct a deterministic Büchi automaton \(\mathcal {A}\) accepting a dense \(\mathbf{\Pi }^0_2\)-subset of \(\mathsf {\Sigma }^\omega \) such that the restriction of F to \(L(\mathcal {A})\) is continuous.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Béal, M.P., Carton, O., Prieur, C., Sakarovitch, J.: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theor. Comput. Sci. 292(1), 45–63 (2003)MathSciNetCrossRef Béal, M.P., Carton, O., Prieur, C., Sakarovitch, J.: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theor. Comput. Sci. 292(1), 45–63 (2003)MathSciNetCrossRef
2.
Zurück zum Zitat Blumensath, A., Grädel, E.: Finite presentations of infinite structures: automata and interpretations. Theory Comput. Syst. 37(6), 641–674 (2004)MathSciNetCrossRef Blumensath, A., Grädel, E.: Finite presentations of infinite structures: automata and interpretations. Theory Comput. Syst. 37(6), 641–674 (2004)MathSciNetCrossRef
3.
Zurück zum Zitat Carton, O., Finkel, O., Simonnet, P.: On the continuity set of an omega rational function. Theor. Inform. Appl. 42(1), 183–196 (2008)MathSciNetCrossRef Carton, O., Finkel, O., Simonnet, P.: On the continuity set of an omega rational function. Theor. Inform. Appl. 42(1), 183–196 (2008)MathSciNetCrossRef
5.
Zurück zum Zitat Finkel, O.: Highly undecidable problems for infinite computations. RAIRO-Theor. Inform. Appl. 43(2), 339–364 (2009)MathSciNetCrossRef Finkel, O.: Highly undecidable problems for infinite computations. RAIRO-Theor. Inform. Appl. 43(2), 339–364 (2009)MathSciNetCrossRef
6.
Zurück zum Zitat Finkel, O.: Three applications to rational relations of the high undecidability of the infinite Post correspondence problem in a regular \(\omega \)-language. Int. J. Found. Comput. Sci. 23(7), 1481–1498 (2012)MathSciNetCrossRef Finkel, O.: Three applications to rational relations of the high undecidability of the infinite Post correspondence problem in a regular \(\omega \)-language. Int. J. Found. Comput. Sci. 23(7), 1481–1498 (2012)MathSciNetCrossRef
7.
Zurück zum Zitat Frougny, C., Sakarovitch, J.: Synchronized rational relations of finite and infinite words. Theor. Comput. Sci. 108(1), 45–82 (1993)MathSciNetCrossRef Frougny, C., Sakarovitch, J.: Synchronized rational relations of finite and infinite words. Theor. Comput. Sci. 108(1), 45–82 (1993)MathSciNetCrossRef
8.
Zurück zum Zitat Gire, F.: Relations rationnelles infinitaires. Ph.D. thesis, Université Paris VII (1981) Gire, F.: Relations rationnelles infinitaires. Ph.D. thesis, Université Paris VII (1981)
12.
Zurück zum Zitat Kuske, D., Lohrey, M.: First-order and counting theories of omega-automatic structures. J. Symb. Logic 73(1), 129–150 (2008)CrossRef Kuske, D., Lohrey, M.: First-order and counting theories of omega-automatic structures. J. Symb. Logic 73(1), 129–150 (2008)CrossRef
13.
14.
Zurück zum Zitat Michalewski, H., Mio, M., Skrzypczak, M.: Monadic second order logic with measure and category quantifiers. Logical Methods Comput. Sci. 14(2) (2018) Michalewski, H., Mio, M., Skrzypczak, M.: Monadic second order logic with measure and category quantifiers. Logical Methods Comput. Sci. 14(2) (2018)
15.
Zurück zum Zitat Perrin, D., Pin, J.E.: Infinite Words, Automata, Semigroups, Logic and Games, Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)MATH Perrin, D., Pin, J.E.: Infinite Words, Automata, Semigroups, Logic and Games, Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)MATH
16.
Zurück zum Zitat Prieur, C.: How to decide continuity of rational functions on infinite words. Theor. Comput. Sci. 250(1–2), 71–82 (2001)MathSciNetCrossRef Prieur, C.: How to decide continuity of rational functions on infinite words. Theor. Comput. Sci. 250(1–2), 71–82 (2001)MathSciNetCrossRef
17.
Zurück zum Zitat Prieur, C.: How to decide continuity of rational functions on infinite words. Theor. Comput. Sci. 276(1–2), 445–447 (2002)CrossRef Prieur, C.: How to decide continuity of rational functions on infinite words. Theor. Comput. Sci. 276(1–2), 445–447 (2002)CrossRef
20.
Zurück zum Zitat Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B, pp. 135–191. Elsevier, Amsterdam (1990) Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B, pp. 135–191. Elsevier, Amsterdam (1990)
Metadaten
Titel
The Automatic Baire Property and an Effective Property of -Rational Functions
verfasst von
Olivier Finkel
Copyright-Jahr
2020
DOI
https://doi.org/10.1007/978-3-030-40608-0_21