Pages that link to "Item:Q1323379"
From MaRDI portal
The following pages link to On the lengths of values in a finite transducer (Q1323379):
Displaying 7 items.
- Reasoning about strings in databases (Q1807679) (← links)
- On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
- Decomposing a $k$-valued transducer into $k$ unambiguous ones (Q3126010) (← links)
- On the Decidability of the Equivalence for a Certain Class of Transducers (Q3637249) (← links)
- Equivalence of finite-valued tree transducers is decidable (Q4301635) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- Using acceptors as transducers (Q5958726) (← links)