A new proof of two theorems about rational transductions

DOI10.1016/0304-3975(79)90049-5zbMath0401.68057OpenAlexW2058224782MaRDI QIDQ1255326

Michel Latteux, André Arnold

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0304-3975(79)90049-5

zbMATH Keywords

Formal LanguageCross-Section TheoremDecomposition of Functional Rational TransductionsSequential Mappings

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Closure under union and composition of iterated rational transductions ⋮ Representation of rational functions with prefix and suffix codings ⋮ Sur les générateurs algébriques et linéaires ⋮ Quasi-automatic semigroups ⋮ Unnamed Item ⋮ Noncommutative rational Pólya series ⋮ Le théorème de transversale rationnelle dans les langages d'arbres ⋮ A construction on finite automata that has remained hidden ⋮ Semi-discrete context-free languages^† ⋮ Iterated relabeling tree transducers

Cites Work

• Unnamed Item
• Transductions des langages de Chomsky
• Sur les rélations rationnelles entre monoides libres
• On tree transducers for partial functions
• On Relations Defined by Generalized Finite Automata

This page was built for publication: A new proof of two theorems about rational transductions