scientific article; zbMATH DE number 3885311

MaRDI QIDQ3219110zbMATH OpenFDO

Authors Juhani Karhumäki, Jetty Kleijn

Publication date 1984

zbMATH Keywords

decidabilityequivalence problemmorphismsrational transductionsregular language

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Mappings of semigroups (20M15) Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3970124
• On the equivalence of some transductions involving letter to letter morphisms on regular languages
• On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages
• On some transducer equivalence problems for families of languages
• Balance of many-valued transductions and equivalence problems

Cited in

(9)

• On the equivalence of some transductions involving letter to letter morphisms on regular languages
• Inverse morphic equivalence on languages
• On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages
• Decidability problems for unary output sequential transducers
• A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language
• scientific article; zbMATH DE number 3860412 (Why is no real title available?)
• scientific article; zbMATH DE number 3970124 (Why is no real title available?)
• On some transducer equivalence problems for families of languages
• scientific article; zbMATH DE number 1339972 (Why is no real title available?)

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 Q3219110)