Note on: ``How to decide continuity of rational functions on infinite words

DOI10.1016/S0304-3975(01)00307-3MaRDI QIDQ1605482zbMATH OpenOpenAlexFDO

Authors Christophe Prieur

Publication date 18 July 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(01)00307-3

zbMATH Keywords

automatatransducersinfinite wordsinfinitary rational relationsadherence of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3754046 (Why is no real title available?)
• How to decide continuity of rational functions on infinite words

Cited in

(8)

• scientific article; zbMATH DE number 7559499 (Why is no real title available?)
• scientific article; zbMATH DE number 7561335 (Why is no real title available?)
• scientific article; zbMATH DE number 7577573 (Why is no real title available?)
• Two Effective Properties of ω-Rational Functions
• Three applications to rational relations of the high undecidability of the infinite Post correspondence problem in a regular \(\omega\)-language
• Automata, Borel functions and real numbers in Pisot base
• Synthesis of computable regular functions of infinite words
• On computability of data word functions defined by transducers

This page was built for publication: Note on: ``How to decide continuity of rational functions on infinite words

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