. . .
About Us
Education
Research
PhD
Acta Cybernetica
Conferences
Sponsors

Departments:
- Image Processing and Computer Graphics
- Foundations of Computer Science
- Computer Algorithms and Artificial Intelligence
- Computational Optimization
- Software Engineering
- Research Group on Artificial Intelligence

[University of Szeged]
Research>>> Acta Cybernetica>>> Previous Volumes>>> Magyarul

Mealy-automata in which the output-equivalence is a congruence

  gif

 

  I. Babcsányi A. Nagygif


Abstract:

  Every Mealy-automaton whose output equivalence is not the universal relation has a non-trivial simple state-homomorphic image. Thus the simple Mealy-automata play an importante role in the theory of Mealy-automata. It is very difficult to describe the structure of these automata. Contrary to the earlier investigations, in our present paper we concentrate our attention only to a special kind of simplicity, namely the strongly simplicity. Besides we give a construction for strongly simple Mealy-automata, we also describe the structure of all Mealy-automata which have strongly simple state-homomorphic image.

 Gyenizse Pal 1996. Szeptember 4. Szerda 12:55:22 MET DST

Webmaster:webmaster@inf.u-szeged.hu