scientific article; zbMATH DE number 4039335

MaRDI QIDQ3777487zbMATH OpenFDO

Authors Juhani Karhumäki

Publication date 1987

zbMATH Keywords

equivalencefinite transducersmappings on languages

Mathematics Subject Classification ID

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

Recommendations

• Equivalence problem of mappings relative to languages
• On the equivalence of some transductions involving letter to letter morphisms on regular languages
• On some transducer equivalence problems for families of languages
• scientific article; zbMATH DE number 4028926
• On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages

Cited in

(6)

• scientific article; zbMATH DE number 1822171 (Why is no real title available?)
• scientific article; zbMATH DE number 3309208 (Why is no real title available?)
• On the power of synchronization in parallel computations
• On languages satisfying “interchange Lemma”
• The equivalence problem for languages defined by transductions on D0L languages
• Decomposing a $k$-valued transducer into $k$ unambiguous ones

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777487)