The following pages link to (Q3736916):
Displaying 12 items.
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- Inverse morphic equivalence on languages (Q1061490) (← links)
- On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages (Q1070829) (← links)
- The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
- Balance of many-valued transductions and equivalence problems (Q1095671) (← links)
- Bifaithful starry transductions (Q1116707) (← links)
- Decidability problems for unary output sequential transducers (Q1179182) (← links)
- Multiplicities: A deterministic view of nondeterminism (Q1194314) (← links)
- The undecidability of some equivalence problems concerning ngsm's and finite substitutions (Q1269922) (← links)
- A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language (Q1820585) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- Cardinality problems of compositions of morphisms and inverse morphisms (Q4203829) (← links)
