Pages that link to "Item:Q4265533"
From MaRDI portal
The following pages link to Undecidability of the equivalence of finite substitutions on regular language (Q4265533):
Displaying 7 items.
- The undecidability of some equivalence problems concerning ngsm's and finite substitutions (Q1269922) (← links)
- The equivalence problem for finite substitutions in a regular language (Q1840955) (← links)
- A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) (Q1887138) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- (Q3409982) (← links)
- (Q4874651) (← links)
- The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications (Q5696933) (← links)