General Idempotency Languages Over Small Alphabets

DOI10.1142/S012905411640013XzbMath1344.68125MaRDI QIDQ5740529

Peter Leupold

Publication date: 27 July 2016

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

zbMATH Keywords

regularityconfluenceformal languagesidempotencystring-rewriting

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

On Regularity-Preservation by String-Rewriting Systems

Cites Work

• On regularity of languages generated by copying systems
• Languages generated by iterated idempotency
• On the regularity of languages on a binary alphabet generated by copying systems
• Uniformly bounded duplication languages
• THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T^a = T^a+b WITH a ≥ 6
• Closure of Language Classes Under Bounded Duplication
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T^m=T^m+n WITH m≥3
• ON THE BURNSIDE SEMIGROUPS xⁿ = x^n+m

This page was built for publication: General Idempotency Languages Over Small Alphabets