Closure under union and composition of iterated rational transductions

DOI10.1051/ITA:2000114MaRDI QIDQ4522113zbMATH OpenOpenAlexFDO

Authors David Simplot, Alain Terlutte

Publication date 19 December 2000

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/221990, https://semanticscholar.org/paper/ca0a5e43475d55623ee3a91a6f5123e0b74c249f

zbMATH Keywords

context-sensitive languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70)

Recommendations

• Iteration of rational transductions
• Iterating transducers
• Invertible transductions and iteration
• Fixed point languages of rational transductions
• Iterated relabeling tree transducers

Cites work

• scientific article; zbMATH DE number 3714977 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• A new proof of two theorems about rational transductions
• Iterated a-NGSM maps and Γ systems
• Iteration of rational transductions
• On Relations Defined by Generalized Finite Automata
• Sur les rélations rationnelles entre monoides libres
• Transductions des langages de Chomsky

Cited in

(6)

• Iterated sequential transducers as language generating devices
• Iterated relabeling tree transducers
• Exponent equations in HNN-extensions
• An Exercise on Fibonacci Representations
• Iteration of rational transductions
• Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems

This page was built for publication: Closure under union and composition of iterated rational transductions

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