Construction of A Semigroup Automaton From A Given (3,2)-semigroup Automaton

Manevska, Vesna (2001) Construction of A Semigroup Automaton From A Given (3,2)-semigroup Automaton. In: Proceedings of the Second 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. 20-30. ISBN 9989-668-28-0

[img]
Preview
Text
9989-668-28-0_pp20-30.pdf

Download (224kB) | Preview
Official URL: http://ciit.finki.ukim.mk

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: Book Section
Uncontrolled Keywords: (3,2)-semigroup, semigroup automata, (3,2)-semigroup automata, languages, (3,2)-languages
Subjects: International Conference on Informatics and Information Technologies > Theoretical Foundation 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/11329

Actions (login required)

View Item View Item