Le degré minimal du groupe d'un code biprefixe fini

DOI10.1016/0097-3165(78)90078-XzbMath0419.20054OpenAlexW2083849570MaRDI QIDQ1132193

Dominique Perrin

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(78)90078-x

zbMATH Keywords

prefix codemirror imageminimal idealbiprefix codefinite biprefix codefinite maximal biprefix codefinite monoid of mappingsgroup of the codeindecomposable codesmappings of minimal rankunion of permutation groups

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45) Multiply transitive finite groups (20B20)

Related Items (3)

La représentation ergodique d'un automate fini ⋮ Anti-exceedances in permutation groups ⋮ On the anti-exceedance distribution on the symmetric group and its subgroups

Cites Work

• La transitivite du groupe d'un code biprefixe fini
• Sur certains sous-monoïdes libres
• Endliche Gruppen I
• Sur un algorithme donnant les codes bipréfixes finis
• On a Special Class of Recurrent Events
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Le degré minimal du groupe d'un code biprefixe fini