Conjugacy on partial words.
type: Item
instance of: scholarly article
title: Conjugacy on partial words.
zbMATH Open document ID: 1061.68123
DOI: 10.1016/S0304-3975(01)00278-X
author: F. Blanchet-Sadri
author: D. K. Luhmann
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 1857066
MaRDI profile type: Publication
cites work: A possible code in the genetic code
cites work: Partial words and a theorem of Fine and Wilf
cites work: Partial words and a theorem of Fine and Wilf revisited
cites work: Q4714446
cites work: Splicing semigroups of dominoes and DNA
cites work: On the combinatorics of finite words
cites work: Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
cites work: On the syntactic structure of protein sequences and the concept of grammar complexity
cites work: Q4341774
full work available at URL: s0304-3975(01)00278-x
OpenAlex ID: W2091483375
Recommended article: Semiperiodic words and root-conjugacy.
Recommended article: Partial words and the interaction property of periods
Recommended article: On a conjecture on bidimensional words.
Recommended article: Conjugation in semigroups.
Recommended article: Algorithmic Combinatorics on Partial Words
Recommended article: Partial words and the critical factorization theorem
Recommended article: Partial words and a theorem of Fine and Wilf
Recommended article: Periodicity properties on partial words
Recommended article: Partial words and a theorem of Fine and Wilf revisited
Recommended article: Q3738586
description: scientific article; zbMATH DE number 1857066