Bounded prefix-suffix duplication: language theoretic and algorithmic results

DOI10.1142/S0129054115400079MaRDI QIDQ5744129zbMATH OpenFDO

Authors Marius Dumitran, Javier Gil, Florin Manea, Victor Mitrana

Publication date 17 February 2016

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

regular languagesmembership problemprefix-suffix duplicationbounded prefix-suffix duplicationbounded prefix-suffix duplication distance

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

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

Cited in

(8)

• Bound-decreasing duplication system
• Deduplication on finite automata and nested duplication systems
• Prefix-suffix duplication
• Bounded prefix-suffix duplication
• On the prefix-suffix duplication reduction
• Prefix-suffix square reduction
• Closure of Language Classes Under Bounded Duplication
• Uniformly bounded duplication languages

This page was built for publication: Bounded prefix-suffix duplication: language theoretic and algorithmic results

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