| dc.contributor.author | Ghadbane, Nacer | |
| dc.date.accessioned | 2020-01-07T14:16:11Z | |
| dc.date.available | 2020-01-07T14:16:11Z | |
| dc.date.issued | 2019-12 | |
| dc.identifier.citation | Applied Mathematics and Computational Intelligence (AMCI), vol.8(1), 2019, pages 9-16 | en_US |
| dc.identifier.issn | 2289-1315 (print) | |
| dc.identifier.issn | 2289-1323 (online) | |
| dc.identifier.uri | http://dspace.unimap.edu.my:80/xmlui/handle/123456789/63747 | |
| dc.description | Link to publisher's homepage at https://amci.unimap.edu.my/ | en_US |
| dc.description.abstract | A transformation semigroup is a pair (Q; S) consisting of a finite set Q, a finite semigroup S
and a semigroup action λ : Q X S Q, (q, s s (q) which means : i) q 𝜖 Q,s, t 𝜖 S : st (q) = s
(t (q)) , and (ii) s, t 𝜖 Sq 𝜖 Q, s (q) = t (q) s = t. A state machine or a semiautomation is
an ordered triple M = (Q, Σ, F ), where Q and are finite sets and F : Q X Σ Q is a partial
function. This paper provides the construction of state machines associate a direct product,
the cascade product, and wreath product of transformations semigroups. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Institute of Engineering Mathematics, Universiti Malaysia Perlis | en_US |
| dc.subject | Semigroup | en_US |
| dc.subject | Semigroup action | en_US |
| dc.subject | Morphism semigroup | en_US |
| dc.subject | Transformation Semi- Group | en_US |
| dc.subject | State machine | en_US |
| dc.title | Transformation semigroups and state machines | en_US |
| dc.type | Article | en_US |
| dc.identifier.url | https://amci.unimap.edu.my/ | |
| dc.contributor.url | nacer.ghadbane@yahoo.com | en_US |
