The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
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.
Download Results (CSV)