| Informatikai Tanszékcsoport>>> Kutatás>>> Acta Cybernetica>>> | In English |
Retractable state-finite automata without outputs1
Attila Nagy2
Acta Cybernetica 16 (2004) 399-409.
Abstract:
A homomorphism of an automaton
without outputs onto a
subautomaton 
of is called a retract homomorphism if it
leaves the elements of 
fixed. An automaton is called a retractable automaton
if, for every subautomaton of , there is a retract
homomorphism of onto . 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.
Footnotes
... Outputs Research supported by the Hungarian NFSR grant No T029525 and No T042481
... Nagy 2 Department of Algebra, Institute of Mathematics, Budapest University of Technology and Economics
Web administrator 2004-09-21