Pages that link to "Item:Q3806848"

The following pages link to On some transducer equivalence problems for families of languages (Q3806848):

Displaying 9 items.

• On the power of synchronization in parallel computations (Q811118) (← links)
• Decidability problems for unary output sequential transducers (Q1179182) (← links)
• The undecidability of some equivalence problems concerning ngsm's and finite substitutions (Q1269922) (← links)
• Equivalence problem of mappings relative to languages (Q1364102) (← links)
• Solvability problems for \(ND\)-systems (Q1592108) (← links)
• Equivalence of transducers relative to regular languages (Q1816023) (← links)
• A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) (Q1887138) (← links)
• The equivalence of deterministic gsm replications onQ-rational languages is decidable (Q3779775) (← links)
• The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications (Q5696933) (← links)