Pages that link to "Item:Q3806848"
From MaRDI portal
The following pages link to On some transducer equivalence problems for families of languages (Q3806848):
Displaying 16 items.
- On the power of synchronization in parallel computations (Q811118) (← links)
- Decidability problems for unary output sequential transducers (Q1179182) (← links)
- The undecidability of some equivalence problems concerning ngsm's and finite substitutions (Q1269922) (← links)
- Equivalence problems for transducers with a bounded number of states (Q1280978) (← links)
- On the lengths of values in a finite transducer (Q1323379) (← links)
- Equivalence problem of mappings relative to languages (Q1364102) (← links)
- Solvability problems for \(ND\)-systems (Q1592108) (← links)
- Equivalence of transducers relative to regular languages (Q1816023) (← links)
- A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) (Q1887138) (← links)
- On Families of Full Trios Containing Counter Machine Languages (Q2817390) (← links)
- SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS (Q3552217) (← links)
- The equivalence of deterministic gsm replications onQ-rational languages is decidable (Q3779775) (← links)
- $§igma TC$-порождаемые языки и проблемы относительной эквивалентности (Q4522712) (← links)
- On equivalence and uniformisation problems for finite transducers (Q4598267) (← links)
- The equivalence problem for languages defined by transductions on D0L languages (Q5462883) (← links)
- The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications (Q5696933) (← links)