Languages generated by iterated idempotency

DOI10.1016/j.tcs.2006.10.021zbMath1118.68080OpenAlexW2065017511MaRDI QIDQ868949

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)

Related Items (3)

On Regularity-Preservation by String-Rewriting Systems ⋮ General Idempotency Languages Over Small Alphabets ⋮ The tandem duplication distance problem is hard over bounded alphabets

Cites Work

• New estimates of odd exponents of infinite Burnside groups.
• On regularity of languages generated by copying systems
• On the regularity of languages on a binary alphabet generated by copying systems
• Uniformly bounded duplication languages
• Uniformly bounded duplication codes
• Algebraic Theory of Automata and Languages
• Semigroups satisfying x m+n = x n
• Aspects of Molecular Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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