Uniformization of rational relations

MaRDI QIDQ4941148zbMATH OpenFDO

Authors Serge Grigorieff, Christian Choffrut

Publication date 29 February 2000

zbMATH Keywords

finite automatarational relation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 6741931
• scientific article; zbMATH DE number 7376069
• Uniformizing rational relations for natural language applications using weighted determinization
• Uniformisations of regular relations over bi-infinite words
• Relations rationnelles infinitaires

Cited in

(14)

• Preservation of normality by unambiguous transducers
• Uniformizing rational relations for natural language applications using weighted determinization
• On the continuity set of an Omega rational function
• On the Topological Complexity of Infinitary Rational Relations
• Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
• Uniformisations of regular relations over bi-infinite words
• On the computation of covert channel capacity
• Polishness of some topologies related to word or tree automata
• Preface
• Two Effective Properties of ω-Rational Functions
• Synthesizing Computable Functions from Rational Specifications Over Infinite Words
• Resynchronized uniformization and definability problems for rational relations
• Edit distance of finite state transducers
• Approximate problems for finite transducers

This page was built for publication: Uniformization of rational relations

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