Languages generated by iterated idempotency
From MaRDI portal
Publication:868949
DOI10.1016/J.TCS.2006.10.021zbMATH Open1118.68080OpenAlexW2065017511MaRDI QIDQ868949FDOQ868949
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New estimates of odd exponents of infinite Burnside groups.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic Theory of Automata and Languages
- Semigroups satisfying x m+n = x n
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the regularity of languages on a binary alphabet generated by copying systems
- On regularity of languages generated by copying systems
- Uniformly bounded duplication languages
- On the irregularity of the duplication closure
- Uniformly bounded duplication codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Aspects of Molecular Computing
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
- Title not available (Why is that?)
- 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)
