Team tournaments and finite elementary codes

DOI10.1016/S0019-9958(81)90568-4zbMath0459.68039OpenAlexW1968442213MaRDI QIDQ3910017

No author found.

Publication date: 1981

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(81)90568-4

zbMATH Keywords

syntactic monoidsergodic product of automatagraph theoretical algorithm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Related Items (7)

On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups ⋮ Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes ⋮ Gérard Lallement (1935-2006) ⋮ A graph covering construction of all the finite complete biprefix codes ⋮ On ideal extensions of completely simple semigroups ⋮ Unions of groups of small height ⋮ Groups of finite elementary codes

This page was built for publication: Team tournaments and finite elementary codes