Prefix-suffix square reduction

DOI10.1016/J.TCS.2016.12.005zbMATH Open1376.68084OpenAlexW2566668411MaRDI QIDQ2358680FDOQ2358680

Authors: Paolo Bottoni, Anna Labella, Victor Mitrana 

Publication date: 15 June 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.12.005

Recommendations

• On the prefix-suffix duplication reduction
• Prefix-suffix square completion
• Duplication Roots
• Bounded prefix-suffix duplication: language theoretic and algorithmic results
• Bounded prefix-suffix duplication

zbMATH Keywords

formal languagesduplicationprefix-suffix square reductionprimitive square reduction root

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?)
• Closure of Language Classes Under Bounded Duplication
• Title not available (Why is that?)
• Efficient enumeration of words in regular languages
• On the irregularity of the duplication closure
• Title not available (Why is that?)
• WORD COMPLEXITY AND REPETITIONS IN WORDS
• Duplication Roots
• On prefix/suffix-square free words
• Prefix-suffix duplication
• Bounded prefix-suffix duplication: language theoretic and algorithmic results
• Bounded prefix-suffix duplication

Cited In (5)

• Title not available (Why is that?)
• On prefix/suffix-square free words
• On the prefix-suffix duplication reduction
• Title not available (Why is that?)
• Prefix-suffix square completion

This page was built for publication: Prefix-suffix square reduction

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