Languages generated by iterated idempotency

DOI10.1016/J.TCS.2006.10.021MaRDI QIDQ868949zbMATH OpenOpenAlexFDO

Authors Peter Leupold

Publication date 26 February 2007

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

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

zbMATH Keywords

formal languagesidempotencystring-rewriting

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• General idempotency languages over small alphabets
• Closure of Language Classes Under Bounded Duplication
• scientific article; zbMATH DE number 1355000
• On regularity of languages generated by copying systems
• Duplication Roots

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 1355000 (Why is no real title available?)
• scientific article; zbMATH DE number 1355188 (Why is no real title available?)
• scientific article; zbMATH DE number 1948509 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 1407503 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• scientific article; zbMATH DE number 3071073 (Why is no real title available?)
• Algebraic Theory of Automata and Languages
• Aspects of Molecular Computing
• New estimates of odd exponents of infinite Burnside groups.
• On regularity of languages generated by copying systems
• On the irregularity of the duplication closure
• On the regularity of languages on a binary alphabet generated by copying systems
• Semigroups satisfying x m+n = x n
• Uniformly bounded duplication codes
• Uniformly bounded duplication languages

Cited in

(7)

• Excessively duplicating patterns represent non-regular languages
• The tandem duplication distance problem is hard over bounded alphabets
• General idempotency languages over small alphabets
• scientific article; zbMATH DE number 2097480 (Why is no real title available?)
• On the regularity of languages on a binary alphabet generated by copying systems
• On Regularity-Preservation by String-Rewriting Systems
• On regularity of languages generated by copying systems

This page was built for publication: Languages generated by iterated idempotency

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