How to decide continuity of rational functions on infinite words

DOI10.1016/S0304-3975(99)00115-2zbMath0952.68076MaRDI QIDQ1589419

Christophe Prieur

Publication date: 12 December 2000

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

zbMATH Keywords

automatainfinite wordstransducersinfinitary rational relationsadherence of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations ⋮ Two Effective Properties of ω-Rational Functions ⋮ On the continuity set of an Omega rational function ⋮ THREE APPLICATIONS TO RATIONAL RELATIONS OF THE HIGH UNDECIDABILITY OF THE INFINITE POST CORRESPONDENCE PROBLEM IN A REGULAR ω-LANGUAGE ⋮ Automata, Borel functions and real numbers in Pisot base ⋮ Finite transducers and rational transductions ⋮ Determinization of transducers over finite and infinite words. ⋮ Squaring transducers: An efficient procedure for deciding functionality and sequentiality. ⋮ Note on: ``How to decide continuity of rational functions on infinite words

Cites Work

• Synchronized rational relations of finite and infinite words
• Relations rationnelles infinitaires
• Two decidability problems for infinite words
• Infinite trees and automaton-definable relations over \(\omega\)-words
• On ω-regular sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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