A new proof of two theorems about rational transductions
From MaRDI portal
Publication:1255326
DOI10.1016/0304-3975(79)90049-5zbMath0401.68057MaRDI QIDQ1255326
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
Formal Language; Cross-Section Theorem; Decomposition of Functional Rational Transductions; Sequential Mappings
68Q45: Formal languages and automata
Related Items
Closure under union and composition of iterated rational transductions, Sur les générateurs algébriques et linéaires, A construction on finite automata that has remained hidden, Representation of rational functions with prefix and suffix codings, Iterated relabeling tree transducers, Noncommutative rational Pólya series, Quasi-automatic semigroups, Unnamed Item, Semi-discrete context-free languages†, Le théorème de transversale rationnelle dans les langages d'arbres
Cites Work