Pages that link to "Item:Q754658"
From MaRDI portal
The following pages link to The decidability of equivalence for deterministic finite transducers (Q754658):
Displayed 5 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 some transducer equivalence problems for families of languages (Q3806848) (← links)
- A note on finite-valued and finitely ambiguous transducers (Q3968472) (← links)