Pages that link to "Item:Q1019714"
From MaRDI portal
The following pages link to Conjugacy of finite biprefix codes (Q1019714):
Displaying 9 items.
- Conjugacy relations of prefix codes (Q287447) (← links)
- Unique decipherability in the monoid of languages: an application of rational relations (Q639857) (← links)
- Congruences, infix and cohesive prefix codes (Q1349710) (← links)
- Conjugacy of a prefix code to a biprefix code (Q1749654) (← links)
- Language equations (Q2074222) (← links)
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) (Q2437851) (← links)
- On Conjugacy of Languages (Q3147021) (← links)
- Unique Decipherability in the Monoid of Languages: An Application of Rational Relations (Q3392943) (← links)
- Towards Decidability of Conjugacy of Pairs and Triples (Q3601812) (← links)