Pages that link to "Item:Q4598267"
From MaRDI portal
The following pages link to On equivalence and uniformisation problems for finite transducers (Q4598267):
Displaying 27 items.
- Balance of many-valued transductions and equivalence problems (Q1095671) (← links)
- A unified framework for disambiguating finite transductions (Q1115635) (← links)
- Decidability problems for unary output sequential transducers (Q1179182) (← links)
- Equivalence problems for transducers with a bounded number of states (Q1280978) (← links)
- Equivalence of transducers relative to regular languages (Q1816023) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- On computability of data word functions defined by transducers (Q2200823) (← links)
- One-way resynchronizability of word transducers (Q2233399) (← links)
- Lipschitz Robustness of Finite-state Transducers (Q2978533) (← links)
- (Q3332228) (← links)
- Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers (Q4608628) (← links)
- (Q4720788) (← links)
- Resynchronizing Classes of Word Relations (Q5002809) (← links)
- (Q5002830) (← links)
- (Q5005148) (← links)
- (Q5089228) (← links)
- (Q5090448) (← links)
- Closure properties of synchronized relations (Q5090470) (← links)
- Origin-equivalence of two-way word transducers is in PSPACE (Q5090958) (← links)
- (Q5090989) (← links)
- On Synthesis of Resynchronizers for Transducers (Q5092432) (← links)
- (Q5101342) (← links)
- (Q5186756) (← links)
- (Q5856426) (← links)
- Synthesizing Computable Functions from Rational Specifications Over Infinite Words (Q6195088) (← links)
- Resynchronized uniformization and definability problems for rational relations (Q6599794) (← links)
- Attributed tree transducers for partial functions (Q6666800) (← links)
