Pages that link to "Item:Q1840955"
From MaRDI portal
The following pages link to The equivalence problem for finite substitutions in a regular language (Q1840955):
Displaying 8 items.
- The undecidability of some equivalence problems concerning ngsm's and finite substitutions (Q1269922) (← links)
- Solvability problems for \(ND\)-systems (Q1592108) (← links)
- A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) (Q1887138) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- Language equations (Q2074222) (← links)
- A Burnside approach to the finite substitution problem (Q2432524) (← links)
- The magic number problem for subregular language families (Q2909186) (← links)
- Undecidability of the equivalence of finite substitutions on regular language (Q4265533) (← links)