TY  - JOUR
KW  - Számítástechnika
KW  -  Nyelvészet - számítógép alkalmazása
TI  - Retractable state-finite automata without outputs
CY  - Szeged
JF  - Acta cybernetica
SP  - 399
A1  -  Nagy Attila
AV  - public
UR  - http://acta.bibl.u-szeged.hu/12730/
N2  - 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.
N1  - Bibliogr.: 409. p. ; összefoglalás angol nyelven
ID  - acta12730
Y1  - 2004///
IS  - 3
VL  - 16
EP  - 409
SN  - 0324-721X
ER  -