CONSTRUCTION OF A SEMIGROUP AUTOMATON FROM A GIVEN (3,2)-SEMIGROUP AUTOMATON

Manevska, Violeta (2001) CONSTRUCTION OF A SEMIGROUP AUTOMATON FROM A GIVEN (3,2)-SEMIGROUP AUTOMATON. Proc. of the 2nd CiiT Conference on Informatics and Information Technology, Molika-Bitola, Macedonia, pp. 20-30.

Full text not available from this repository.

Abstract

The aim of the talk is to present two algorithms about a construction of a semigroup automaton from a given (3,2)-semigroup automaton. The first one introduces new states on the arrows of the given (3,2)-semigroup automaton, while the second examines the recognizable words from the (3,2)-semigroup automaton and then deletes the arrows not accessible from those words.

Item Type: Article
Subjects: Scientific Fields (Frascati) > Natural sciences > Computer and information sciences
Divisions: Faculty of Information and Communication Technologies
Depositing User: Unnamed user with email vladimir.milevski@uklo.edu.mk
Date Deposited: 17 Mar 2016 14:27
Last Modified: 17 Mar 2016 14:27
URI: http://eprints.uklo.edu.mk/id/eprint/17

Actions (login required)

View Item View Item