Pages that link to "Item:Q5167824"
From MaRDI portal
The following pages link to Transducers with Origin Information (Q5167824):
Displaying 24 items.
- Decision problems of tree transducers with origin (Q1641005) (← links)
- Inferring regular languages and \(\omega\)-languages (Q1648037) (← links)
- Regular \(\omega\)-languages with an informative right congruence (Q2029605) (← links)
- Learning algorithms (Q2074213) (← links)
- One-way resynchronizability of word transducers (Q2233399) (← links)
- Linking theorems for tree transducers (Q2628796) (← links)
- Deciding origin equivalence of weakly self-nesting macro tree transducers (Q2680223) (← links)
- Regular Transformations of Data Words Through Origin Information (Q2811346) (← links)
- A Circuit Complexity Approach to Transductions (Q2946331) (← links)
- Transducers are type-converters (Q3334066) (← links)
- (Q3384896) (← links)
- (Q3386623) (← links)
- Provenance Circuits for Trees and Treelike Instances (Q3449465) (← links)
- Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
- (Q3692894) (← links)
- Deterministic Stack Transducers (Q4605515) (← links)
- Resynchronizing Classes of Word Relations (Q5002809) (← links)
- (Q5089228) (← links)
- (Q5090448) (← links)
- Origin-equivalence of two-way word transducers is in PSPACE (Q5090958) (← links)
- (Q5090969) (← links)
- On Synthesis of Resynchronizers for Transducers (Q5092432) (← links)
- From Two-Way Transducers to Regular Function Expressions (Q5859650) (← links)
- Resynchronized uniformization and definability problems for rational relations (Q6599794) (← links)