Uniformly bounded duplication codes

DOI10.1051/ITA:2007021zbMATH Open1144.68047OpenAlexW1964414758MaRDI QIDQ3512596FDOQ3512596

Peter Leupold, Victor Mitrana

Publication date: 21 July 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2007__41_4_411_0

Recommendations

• Uniformly bounded duplication languages
• Duplication Roots
• Closure of Language Classes Under Bounded Duplication
• Aspects of Molecular Computing
• Bounded prefix-suffix duplication

zbMATH Keywords

square-free word

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Uniqueness Theorems for Periodic Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Uniformly bounded duplication languages
• On the irregularity of the duplication closure
• Title not available (Why is that?)
• Aspects of Molecular Computing

Cited In (3)

• Languages generated by iterated idempotency
• Uniformly bounded duplication languages
• On Compensation Loops in Genomic Duplications

This page was built for publication: Uniformly bounded duplication codes

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