Iteration of rational transductions
From MaRDI portal
Publication:4508635
DOI10.1051/ita:2000109zbMath0962.68090OpenAlexW2107573202MaRDI QIDQ4508635
Publication date: 3 October 2000
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222099
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)
Related Items
Closure under union and composition of iterated rational transductions ⋮ A Kleene characterization of computability ⋮ Consensus Game Acceptors and Iterated Transductions ⋮ A canonical automaton for one-rule length-preserving string rewrite systems ⋮ Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates ⋮ On prefixal one-rule string rewrite systems ⋮ An Exercise on Fibonacci Representations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial commutations and faithful rational transductions
- The method of forced enumeration for nondeterministic automata
- Transductions des langages de Chomsky
- Sur les rélations rationnelles entre monoides libres
- On characterizations of recursively enumerable languages
- Context-sensitive string languages and recognizable picture languages
- Recognizable picture languages and domino tiling
- Nondeterministic Space is Closed under Complementation
- Iterated a-NGSM maps and Γ systems
- Some characterizations of functions computable in on-line arithmetic
- Closure under union and composition of iterated rational transductions
- On Relations Defined by Generalized Finite Automata
- Full AFLs and nested iterated substitution
- Classes of languages and linear-bounded automata