Binary codes that do not preserve primitivity

DOI10.1007/978-3-031-10769-6_23OpenAlexW4289104060MaRDI QIDQ2104527

Štěpán Holub, Martin Raška, Štěpán Starosta

Publication date: 7 December 2022

Full work available at URL: https://arxiv.org/abs/2203.11341

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (2)

Binary codes that do not preserve primitivity ⋮ Binary_Code_Imprimitive

Uses Software

• Isabelle/HOL
• Archive Formal Proofs
• Combinatorics_Words

Cites Work

• Primitive morphisms
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
• Sur le théorème du defaut
• Sharp characterizations of squarefree morphisms
• On the independence of equations in three variables.
• On F-semigroups with three generators
• Uniqueness Theorems for Periodic Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Binary codes that do not preserve primitivity