RAIRO-Theor. Inf. Appl.
Volume 34, Number 4, July/August 2000
|Page(s)||307 - 330|
|Published online||15 April 2002|
Semi-commutations and Partial commutations
LIFL, bâtiment M3, Cité Scientifique,
59655 Villeneuve-d'Ascq Cedex, France; (firstname.lastname@example.org)
2 LIFL, bâtiment M3, Cité Scientifique, 59655 Villeneuve-d'Ascq Cedex, France; (email@example.com)
3 LIFL, bâtiment M3, Cité Scientifique, 59655 Villeneuve-d'Ascq Cedex, France; (firstname.lastname@example.org)
Accepted: 21 September 2000
The aim of this paper is to show that a semi-commutation function can be expressed as the compound of a sequential transformation, a partial commutation function, and the reverse transformation. Moreover, we give a necessary and sufficient condition for the image of a regular language to be computed by the compound of two sequential functions and a partial commutation function.
Mathematics Subject Classification: 68Q45 / 68Q85
© EDP Sciences, 2000
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.