Languages generated by iterated idempotency
type: Item
instance of: scholarly article
title: Languages generated by iterated idempotency
zbMATH Open document ID: 1118.68080
author: Peter Leupold
published in: Theoretical Computer Science
publication date: 2007-02-26T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5129789
zbMATH Keywords: formal languages
zbMATH Keywords: idempotency
zbMATH Keywords: string-rewriting
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.10.021
OpenAlex ID: W2065017511
cites work: New estimates of odd exponents of infinite Burnside groups.
cites work: On the regularity of languages on a binary alphabet generated by copying systems
cites work: Q4412125
cites work: Q4940888
cites work: Semigroups satisfying x m+n = x n
cites work: On regularity of languages generated by copying systems
cites work: Q5809194
cites work: Q4198075
cites work: Algebraic Theory of Automata and Languages
cites work: Uniformly bounded duplication languages
cites work: Uniformly bounded duplication codes
cites work: Aspects of Molecular Computing
cites work: Q3659988
cites work: Q4529547
cites work: Q4269223
cites work: Q4269399
cites work: Q4223673
cites work: Q5678435
cites work: On the irregularity of the duplication closure
DOI: 10.1016/J.TCS.2006.10.021
description: scientific article; zbMATH DE number 5129789