Binary codes that do not preserve primitivity

DOI10.1007/978-3-031-10769-6_23MaRDI QIDQ2104527zbMATH OpenOpenAlexFDO

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

Publication date 7 December 2022

Copyright license Creative Commons Attribution 4.0 International

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)

Cites work

• scientific article; zbMATH DE number 3350192 (Why is no real title available?)
• 12th international conference on interactive theorem proving, ITP 2021, Rome, Italy, virtual conference, June 29 -- July 1, 2021
• Codes and automata.
• Defect effect of Bi-infinite words in the two-element case
• On F-semigroups with three generators
• On the independence of equations in three variables.
• Primitive morphisms
• Sharp characterizations of squarefree morphisms
• Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
• Sur le théorème du defaut
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Uniqueness Theorems for Periodic Functions

Cited in

(2)

• Binary_Code_Imprimitive
• Binary codes that do not preserve primitivity

Describes a project that uses

Uses Software

• Isabelle/HOL
• Archive Formal Proofs
• Combinatorics_Words

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104527)