Closure under union and composition of iterated rational transductions
From MaRDI portal
Publication:4522113
DOI10.1051/ITA:2000114zbMATH Open0970.68085OpenAlexW2128607881MaRDI QIDQ4522113FDOQ4522113
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
Recommendations
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70)
Cites Work
- Title not available (Why is that?)
- On Relations Defined by Generalized Finite Automata
- Sur les rélations rationnelles entre monoides libres
- Iteration of rational transductions
- Transductions des langages de Chomsky
- Title not available (Why is that?)
- A new proof of two theorems about rational transductions
- Iterated a-NGSM maps and Γ systems
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)
