The following pages link to Codes conjugués (Q5668358):
Displayed 22 items.
- Conjugacy relations of prefix codes (Q287447) (← links)
- Unique decipherability in the monoid of languages: an application of rational relations (Q639857) (← links)
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
- On the existence of prime decompositions (Q880173) (← links)
- A note on autodense related languages (Q977173) (← links)
- Conjugacy of finite biprefix codes (Q1019714) (← links)
- Some free submonoids of the free monoid of prefix codes (Q1215352) (← links)
- Prefix codes, trees, and automata (Q1217779) (← links)
- Right \(k\)-dense languages (Q1322582) (← links)
- Free submonoids in the monoid of languages (Q1381858) (← links)
- On certain codes admitting inverse semigroups as syntactic monoids (Q1845834) (← links)
- Commutation with codes (Q2484442) (← links)
- On Language Decompositions and Primality (Q3003471) (← links)
- Codes et motifs (Q3031953) (← links)
- On Conjugacy of Languages (Q3147021) (← links)
- Unique Decipherability in the Monoid of Languages: An Application of Rational Relations (Q3392943) (← links)
- On the simplest centralizer of a language (Q3431440) (← links)
- An equivalence relation on suffix codes defined by generalized regular languages (Q3477988) (← links)
- A note on the free submonoids of the monoid of prefix codes (Q3838259) (← links)
- Prefix codes and isomorphic automata (Q5181256) (← links)
- Unique decipherability in the additive monoid of sets of numbers (Q5198933) (← links)
- Systems of equations over a finite set of words and automata theory (Q6114515) (← links)