On canonical models for rational functions over infinite words

DOI10.4230/LIPICS.FSTTCS.2018.30MaRDI QIDQ5090969zbMATH OpenFDO

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

Publication date 21 July 2022

zbMATH Keywords

minimizationfirst-order logictransducersinfinite wordsaperiodicty

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Recommendations

• Determinization of transducers over finite and infinite words.
• Determinization of transducers over infinite words: The general case
• scientific article; zbMATH DE number 1670852
• First-order definability of rational transductions: an algebraic approach
• scientific article; zbMATH DE number 1047903

Cites work

• scientific article; zbMATH DE number 3924161 (Why is no real title available?)
• scientific article; zbMATH DE number 6862041 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• A combinatorial approach to the theory of ω-automata
• A syntactic congruence for rational \(\omega\)-languages
• Automata and semigroups recognizing infinite words
• Determinization of transducers over infinite words: The general case
• First-order definability of rational transductions: an algebraic approach
• First-order definable languages
• Learning rational functions
• Logic-automata connections for transformations
• Logical and algebraic characterizations of rational transductions
• Minimization of Rational Word Functions
• Minimizing subsequential transducers: a survey.
• Monadic second-order definable graph transductions: a survey
• Note on: ``How to decide continuity of rational functions on infinite words
• On Relations Defined by Generalized Finite Automata
• On finite monoids having only trivial subgroups
• Past, present, and infinite future
• Right-sequential functions on infinite words
• Star-free regular sets of ω-sequences
• Transducers with Origin Information
• Two decidability problems for infinite words
• Unambiguous Büchi automata.

Cited in

(1)

• The many facets of string transducers (invited talk)

This page was built for publication: On canonical models for rational functions over infinite words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090969)