Retractable state-finite automata without outputs

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

[thumbnail of Nagy_2004_ActaCybernetica.pdf]
Cikk, tanulmány, mű

Download (151kB) | Preview


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: English
Place of Publication: Szeged
Related URLs:
Uncontrolled Keywords: Számítástechnika, Nyelvészet - számítógép alkalmazása
Additional Information: Bibliogr.: 409. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 15. 10:34

Actions (login required)

View Item View Item