2016
DOI: 10.1142/s012905411640013x
|View full text |Cite
|
Sign up to set email alerts
|

General Idempotency Languages Over Small Alphabets

Abstract: Idempotency languages are generated from a single word by iterated application of rules of the form u m → u n for natural numbers m and n. We investigate these languages over alphabets of only one or two letters. The conditions under which the underlying rewrite relations are confluent are fully characterized. Then for many combinations of the parameters m and n we answer the question, whether the corresponding idempotency languages are regular or not. What remains open are only the cases where 2 ≤ m < n.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 12 publications
(17 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?