Pages that link to "Item:Q754658"

The following pages link to The decidability of equivalence for deterministic finite transducers (Q754658):

Displaying 9 items.

• Efficient constructions of test sets for regular and context-free languages (Q685373) (← links)
• New techniques for proving the decidability of equivalence problem (Q913523) (← links)
• The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
• On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
• Equivalence Checking Problem for Finite State Transducers over Semigroups (Q2947161) (← links)
• On some transducer equivalence problems for families of languages (Q3806848) (← links)
• A note on finite-valued and finitely ambiguous transducers (Q3968472) (← links)
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
• (Q5090448) (← links)