Pages that link to "Item:Q1253937"
From MaRDI portal
The following pages link to Some decidability results about regular and pushdown translations (Q1253937):
Displaying 14 items.
- On some decision questions concerning pushdown machines (Q593781) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- On the equivalence of some transductions involving letter to letter morphisms on regular languages (Q1058303) (← links)
- Inverse morphic equivalence on languages (Q1061490) (← links)
- An undecidable problem for context-free grammars (Q1067789) (← links)
- On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages (Q1070829) (← links)
- Two decidability problems for infinite words (Q1072715) (← links)
- The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
- Balance of many-valued transductions and equivalence problems (Q1095671) (← links)
- 2DST mappings of languages and related problems (Q1164438) (← links)
- Checking sets, test sets, rich languages and commutatively closed languages (Q1837540) (← links)
- Dominoes over a free monoid (Q1838319) (← links)
- On some transducer equivalence problems for families of languages (Q3806848) (← links)
- A homomorphic characterization of time and space complexity classes of languages† (Q3888530) (← links)
