Cyclotomic polynomials and unions of groups

DOI10.1016/0012-365X(78)90170-XzbMath0404.68084OpenAlexW2019816994MaRDI QIDQ1256865

Gerard Lallement

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(78)90170-x

zbMATH Keywords

Cyclotomic PolynomialsFinite MonoidFinite Prefix CodesGroup CodesLanguage Recognition By AutomataSynchronized CodesSyntactic MonoidsTransformation MonoidUnion of Groups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Artificial intelligence (68T99) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45) Synchronization error-correcting codes (94B50)

Related Items (4)

On varieties of rational languages and variable length codes. II ⋮ Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes ⋮ Gérard Lallement (1935-2006) ⋮ Unions of groups of small height

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular semigroups with D=R as syntactic monoids of prefix codes
• Relationships between combinatorics and 0-simple semigroups
• Sur le produit de concatenation non ambigu
• On the factorisation of finite abelian groups
• THE FACTORIZATION OF ABELIAN GROUPS
• Codes asynchrones
• On the Factorization of Finite Groups
• On finite monoids having only trivial subgroups
• On Some Special Factorizations of (1-xⁿ)/(1-x)
• Sur le problème de factorisation des groupes cycliques
• Ein Beitrag zum Problem der Faktorisation von endlichen Abelschen Gruppen

This page was built for publication: Cyclotomic polynomials and unions of groups