Fully Commutative (3,2)-automata

Manevska, Vesna and Dimovski, D. (2003) Fully Commutative (3,2)-automata. In: Proceedings of the Fourth Conference on Informatics and Information Technology. Institute of Informatics, Faculty of Natural Sciences and Mathematics, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 374-379. ISBN 9989-668-45-0

[img]
Preview
Text
9989-668-45-0_pp374-379.pdf

Download (1MB) | Preview
Official URL: http://ciit.finki.ukim.mk

Abstract

In this paper we introduce the notation of fully commutative (3,2)-automata. A pair (B, { }), where B is a nonempty set, is said to be a fully commutative (3,2)-semigroup if f is an associative mapping from B into B. Here, B is { a 1... a i | a 1,..., a i  B } of the free commutative semigroup B ( ) generat- ed by B. A triple ( S, ( B, { }), f ), where S is a set, (B, { }) is a fully commutative the subset (3,2)-semigroup, is said to be a fully commutative (3,2)-automata if f is a mapping from S  B to S  B satisfying f ( f ( s, x, y ), z )  f ( s, { xyz }). We will show some properties about them and give a connection with commutative (2,1)-automata.

Item Type: Book Section
Uncontrolled Keywords: fully commutative (3,2)-semigroup, fully commutative (3,2)-automaton
Subjects: International Conference on Informatics and Information Technologies > Theoretical backgrounds of CS
Depositing User: Vangel Ajanovski
Date Deposited: 28 Oct 2016 00:15
Last Modified: 28 Oct 2016 00:15
URI: http://eprints.finki.ukim.mk/id/eprint/11331

Actions (login required)

View Item View Item