Identities and transductions

DOI10.1007/3-540-58131-6_43zbMath1529.68139OpenAlexW1498664341MaRDI QIDQ6142877

Tero J.Harju, Hendrik Jan Hoogeboom, H. C. M. Kleijn

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58131-6_43

zbMATH Keywords

free monoidinclusion problemrational transductionbinary alphabetidentity relation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Systems of equations over a free monoid and Ehrenfeucht's conjecture
• On the equivalence of some transductions involving letter to letter morphisms on regular languages
• On the defect theorem and simplifiability
• On the decidability of some problems about rational subsets of free partially commutative monoids
• A note on morphic characterization of languages
• Decidability problems for unary output sequential transducers
• Sur les rélations rationnelles entre monoides libres
• The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications