Pages that link to "Item:Q1164438"

The following pages link to 2DST mappings of languages and related problems (Q1164438):

Displaying 6 items.

• The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
• A note on Parikh maps, abstract languages, and decision problems (Q1065555) (← links)
• The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
• Equivalence problem of mappings relative to languages (Q1364102) (← links)
• The equivalence of deterministic gsm replications onQ-rational languages is decidable (Q3779775) (← links)
• On some transducer equivalence problems for families of languages (Q3806848) (← links)