Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-13T08:34:58.623Z Has data issue: false hasContentIssue false
  • English
  • Français

Semi-commutations and Partial commutations

Published online by Cambridge University Press:  15 April 2002

M. Clerbout ,
Y. Roos  and
I. Ryl
M. Clerbout
Affiliation:
LIFL, bâtiment M3, Cité Scientifique, 59655 Villeneuve-d'Ascq Cedex, France; (clerbout@lifl.fr)
Y. Roos
Affiliation:
LIFL, bâtiment M3, Cité Scientifique, 59655 Villeneuve-d'Ascq Cedex, France; (yroos@lifl.fr)
I. Ryl
Affiliation:
LIFL, bâtiment M3, Cité Scientifique, 59655 Villeneuve-d'Ascq Cedex, France; (ryl@lifl.fr)
Get access

Abstract

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.

Keywords

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 34 , Issue 4 , July 2000 , pp. 307 - 330
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)