Bifaithful starry transductions

DOI10.1016/0020-0190(88)90135-4zbMath0666.68072OpenAlexW1987364072MaRDI QIDQ1116707

E. Timmermann, Michel Latteux

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90135-4

zbMATH Keywords

nonerasing morphismsrational transductionbifaithfulstarry transductions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Some Characterization of Recursively Enumerable Sets ⋮ Representation of rational functions with prefix and suffix codings ⋮ On characterizations of recursively enumerable languages

Cites Work

• A homomorphic characterization of regular languages
• A note on morphic characterization of languages
• A homomorphic characterization of principal semi AFLs without using intersection with regular sets
• Sur diverses familles de langages fermées par transduction rationnelle
• A new normal form for the compositions of morphisms and inverse morphisms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bifaithful starry transductions