Retractable state-finite automata without outputs

Nagy, Attila: Retractable state-finite automata without outputs. In: Acta cybernetica, (16) 3. pp. 399-409. (2004)

[img]
Preview
Cikk, tanulmány, mű
Nagy_2004_ActaCybernetica.pdf

Download (151kB) | Preview

Abstract

A homomorphism of an automaton A without outputs onto a subautomaton B of A is called a retract homomorphism if it leaves the elements of B fixed. An automaton A is called a retractable automaton if, for every subautomaton B of A, there is a retract homomorphism of A onto B. In [1] and [3], special retractable automata are examined. The purpose of this paper is to give a construction for state-finite retractable automata without outputs.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2004
Volume: 16
Number: 3
ISSN: 0324-721X
Page Range: pp. 399-409
Language: angol
Related URLs: http://acta.bibl.u-szeged.hu/38517/
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: 409. p.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2021. Mar. 24. 14:45
URI: http://acta.bibl.u-szeged.hu/id/eprint/12730

Actions (login required)

View Item View Item