The following pages link to Single-valued a-transducers (Q1242878):
Displaying 16 items.
- The decidability of equivalence for deterministic finite transducers (Q754658) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- On the equivalence of some transductions involving letter to letter morphisms on regular languages (Q1058303) (← links)
- Rational equivalence relations (Q1089801) (← links)
- The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
- A unified framework for disambiguating finite transductions (Q1115635) (← links)
- Deciding the immutability of regular codes and languages under finite transduction (Q1120291) (← links)
- Codeterministic Lindenmayer schemes and systems (Q1139944) (← links)
- On the lengths of values in a finite transducer (Q1323379) (← links)
- Determinization of transducers over finite and infinite words. (Q1853526) (← links)
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality. (Q1853731) (← links)
- Finite transducers and rational transductions (Q2074205) (← 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)
- (Q5090448) (← links)
- On Synthesis of Resynchronizers for Transducers (Q5092432) (← links)
