Binary codes that do not preserve primitivity
From MaRDI portal
Publication:6111526
DOI10.1007/s10817-023-09674-2OpenAlexW4384665483MaRDI QIDQ6111526
Štěpán Starosta, Martin Raška, Štěpán Holub
Publication date: 4 August 2023
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-023-09674-2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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.
- Isabelle/HOL. A proof assistant for higher-order logic
- Commutation and beyond (extended abstract)
- On F-semigroups with three generators
- Binary codes that do not preserve primitivity
- A Second Course in Formal Languages and Automata Theory
- LARGE SIMPLE BINARY EQUALITY WORDS
- Uniqueness Theorems for Periodic Functions
- Formalization of Basic Combinatorics on Words
This page was built for publication: Binary codes that do not preserve primitivity
