Document Open Access Logo

On Canonical Models for Rational Functions over Infinite Words

Authors Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, Anca Muscholl

PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2018.30.pdf
  • Filesize: 0.49 MB
  • 17 pages

Document Identifiers

Author Details

Emmanuel Filiot
  • Université Libre de Bruxelles, Belgium
Olivier Gauwin
  • LaBRI, Université de Bordeaux, France
Nathan Lhote
  • LaBRI, Université de Bordeaux, France and Université Libre de Bruxelles, Belgium
Anca Muscholl
  • LaBRI, Université de Bordeaux, France

Funding

This work was supported by the French ANR projects ExStream (ANR-13-JS02-0010) and DeLTA (ANR-16-CE40-0007), the Belgian FNRS CDR project Flare (J013116) and the ARC project Transform (Fédération Wallonie Bruxelles).

Cite AsGet BibTex

Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, and Anca Muscholl. On Canonical Models for Rational Functions over Infinite Words. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 122, pp. 30:1-30:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.FSTTCS.2018.30

Abstract

This paper investigates canonical transducers for rational functions over infinite words, i.e., functions of infinite words defined by finite transducers. We first consider sequential functions, defined by finite transducers with a deterministic underlying automaton. We provide a Myhill-Nerode-like characterization, in the vein of Choffrut's result over finite words, from which we derive an algorithm that computes a transducer realizing the function which is minimal and unique (up to the automaton for the domain). The main contribution of the paper is the notion of a canonical transducer for rational functions over infinite words, extending the notion of canonical bimachine due to Reutenauer and Schützenberger from finite to infinite words. As an application, we show that the canonical transducer is aperiodic whenever the function is definable by some aperiodic transducer, or equivalently, by a first-order transduction. This allows to decide whether a rational function of infinite words is first-order definable.

Subject Classification

ACM Subject Classification
  • Theory of computation → Transducers
Keywords
  • transducers
  • infinite words
  • minimization
  • aperiodicty
  • first-order logic

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. André Arnold. A Syntactic Congruence for Rational ω-Languages. Theoretical Computer Science, 39(2-3):333-335, August 1985. Note. Google Scholar
  2. Marie-Pierre Béal and Olivier Carton. Determinization of Transducers over Infinite Words: The General Case. Theory Comput. Syst., 37(4):483-502, 2004. Google Scholar
  3. Adrien Boiret, Aurélien Lemay, and Joachim Niehren. Learning Rational Functions. In Developments in Language Theory - 16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings, pages 273-283, 2012. Google Scholar
  4. Mikolaj Bojanczyk. Transducers with Origin Information. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, editors, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, volume 8573 of Lecture Notes in Computer Science, pages 26-37. Springer, 2014. Google Scholar
  5. Olivier Carton. Right-Sequential Functions on Infinite Words. In Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings, pages 96-106, 2010. Google Scholar
  6. Olivier Carton and Max Michel. Unambiguous Büchi automata. Theor. Comput. Sci., 297(1-3):37-81, 2003. Google Scholar
  7. Olivier Carton, Dominique Perrin, and Jean-Eric Pin. Automata and semigroups recognizing infinite words. In Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., pages 133-168, 2008. Google Scholar
  8. Christian Choffrut. Minimizing subsequential transducers: a survey. Theor. Comput. Sci., 292(1):131-143, 2003. Google Scholar
  9. Bruno Courcelle. Monadic Second-Order Definable Graph Transductions: A Survey. Theor. Comput. Sci., 126(1):53-75, 1994. Google Scholar
  10. Volker Diekert and Paul Gastin. First-order definable languages. In Jörg Flum, Erich Grädel, and Thomas Wilke, editors, Logic and Automata, volume 2 of Texts in Logic and Games, pages 261-306. Amsterdam University Press, 2008. Google Scholar
  11. Calvin C. Elgot and Jorge E. Mezei. On Relations Defined by Generalized Finite Automata. IBM Journal of Research and Development, 9(1):47-68, 1965. Google Scholar
  12. Emmanuel Filiot. Logic-Automata Connections for Transformations. In Indian Conference on Logic and Its Applications (ICLA), volume 8923 of Lecture Notes in Computer Science, pages 30-57. Springer, 2015. Google Scholar
  13. Emmanuel Filiot, Olivier Gauwin, and Nathan Lhote. Aperiodicity of Rational Functions Is PSPACE-Complete. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India, pages 13:1-13:15, 2016. Google Scholar
  14. Emmanuel Filiot, Olivier Gauwin, and Nathan Lhote. First-order definability of rational transductions: An algebraic approach. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS, pages 387-396. ACM, 2016. Google Scholar
  15. Emmanuel Filiot, Olivier Gauwin, and Nathan Lhote. Logical and Algebraic Characterizations of Rational Transductions. CoRR, abs/1705.03726, 2017. Available from: URL: http://arxiv.org/abs/1705.03726.
  16. Françoise Gire. Two Decidability Problems for Infinite Words. Inf. Process. Lett., 22(3):135-140, 1986. Google Scholar
  17. Robert McNaughton and Seymour Papert. Counter-free automata. M.I.T. Press, 1971. Google Scholar
  18. D. Perrin. Recent results on automata and infinite words. In M. P. Chytil and V. Koubek, editors, Proceedings of the 11th Symposium on Mathematical Foundations of Computer Science, volume 176 of LNCS, pages 134-148, Praha, Czechoslovakia, September 1984. Springer. Google Scholar
  19. Christophe Prieur. How to decide continuity of rational functions on infinite words. Theor. Comput. Sci., 276(1-2):445-447, 2002. Google Scholar
  20. Christophe Reutenauer and Marcel Paul Schützenberger. Minimization of Rational Word Functions. SIAM J. Comput., 20(4):669-685, 1991. Google Scholar
  21. Marcel-Paul Schützenberger. On Finite Monoids Having Only Trivial Subgroups. Information and Control, 8(2):190-194, 1965. Google Scholar
  22. W. Thomas. Languages, Automata and Logic. In A. Salomaa and G. Rozenberg, editors, Handbook of Formal Languages, volume 3, Beyond Words. Springer, Berlin, 1997. Google Scholar
  23. Wolfgang Thomas. Star-Free Regular Sets of omega-Sequences. Information and Control, 42(2):148-156, August 1979. Google Scholar
  24. Wolfgang Thomas. A Combinatorial Approach to the Theory of omega-Automata. Information and Control, 48(3):261-283, 1981. Google Scholar
  25. Thomas Wilke. Past, Present, and Infinite Future. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, pages 95:1-95:14, 2016. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact