The following pages link to (Q4101446):
Displayed 7 items.
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
- A unified framework for disambiguating finite transductions (Q1115635) (← links)
- Determinization of transducers over finite and infinite words. (Q1853526) (← links)
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality. (Q1853731) (← links)
- On the representation of finite deterministic 2-tape automata (Q1960654) (← links)
- On the Decidability of the Equivalence for k-Valued Transducers (Q3533016) (← links)