Prefix-suffix duplication

DOI10.1016/J.JCSS.2014.02.011zbMATH Open1410.68202OpenAlexW2059771609MaRDI QIDQ2453545FDOQ2453545

Authors: Florin Manea, Victor Mitrana, J. García-López 

Publication date: 10 June 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.02.011

Recommendations

• Bounded prefix-suffix duplication
• Bounded prefix-suffix duplication: language theoretic and algorithmic results
• Uniformly bounded duplication languages
• Duplications and pseudo-duplications
• On the prefix-suffix duplication reduction

zbMATH Keywords

algorithms on wordsbio-inspired operationslanguage-theoretical propertiesprefix-suffix duplicationprefix-suffix duplication distance

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms (68W40) Algorithms on strings (68W32)

Cites Work

• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear work suffix array construction
• Squares, cubes, and time-space efficient string searching
• On the regularity of languages on a binary alphabet generated by copying systems
• A helpful result for proving inherent ambiguity
• On the irregularity of the duplication closure
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Bound-decreasing duplication system
• Bounded prefix-suffix duplication
• On prefix/suffix-square free words
• On the prefix-suffix duplication reduction
• Prefix-suffix square reduction
• Watson-Crick jumping finite automata
• Prefix-suffix square completion
• SQUARE COMPLETION OPERATION OF MAXIMAL SUFFIX IN FIBONACCI WORD
• Bounded prefix-suffix duplication: language theoretic and algorithmic results

This page was built for publication: Prefix-suffix duplication

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