Cyclotomic polynomials and unions of groups

DOI10.1016/0012-365X(78)90170-XzbMath0404.68084MaRDI 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 Polynomials; Finite Monoid; Finite Prefix Codes; Group Codes; Language Recognition By Automata; Synchronized Codes; Syntactic Monoids; Transformation Monoid; Union of Groups

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68T99: Artificial intelligence

20M35: Semigroups in automata theory, linguistics, etc.

94A45: Prefix, length-variable, comma-free codes

94B50: Synchronization error-correcting codes

Related Items

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

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