Pages that link to "Item:Q5444976"
From MaRDI portal
The following pages link to The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable (Q5444976):
Displayed 4 items.
- Unique decipherability in the monoid of languages: an application of rational relations (Q639857) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- Language equations (Q2074222) (← links)
- Unique Decipherability in the Monoid of Languages: An Application of Rational Relations (Q3392943) (← links)