Languages Generated by Iterated Idempotencies.

Identificador:  TDX:570

Handle: https://hdl.handle.net/20.500.11797/TDX570

Autores:  Leupold, Klaus-Peter

Resumen:
The rewrite relation with parameters m and n and with the possible length limit = k or :::; k we denote by w~, =kW~· or ::;kw~ respectively. The idempotency languages generated from a starting word w by the respective operations are wD 1 are more complicated and belong to the class of context-free languages.For a generallength bound, i.e.'for the relations :'::kW~, confluence does not hold so frequently. This complicatedness of the relations results also in more complicated languages, which are often non-regular, as for example the languages W<;kD