General idempotency languages over small alphabets

DOI10.1142/S012905411640013XMaRDI QIDQ5740529zbMATH OpenFDO

Authors Peter Leupold

Publication date 27 July 2016

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

Full work available at URL https://doi.org/10.1142/S012905411640013X

zbMATH Keywords

confluenceformal languagesidempotencyregularitystring-rewriting

Mathematics Subject Classification ID

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

Recommendations

• Languages generated by iterated idempotency
• On Varieties of Literally Idempotent Languages
• Literally idempotent languages and their varieties --- two letter case
• Generating sets and decompositions for idempotent tree languages
• On Regularity-Preservation by String-Rewriting Systems

Cites work

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

Cited in

(4)

• Literally idempotent languages and their varieties --- two letter case
• On Varieties of Literally Idempotent Languages
• On Regularity-Preservation by String-Rewriting Systems
• Languages generated by iterated idempotency

This page was built for publication: General idempotency languages over small alphabets

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