Machine Morphisms and Simulation

Authors: Janis Buls

Abstract:

This paper examines the concept of simulation from a modelling viewpoint. How can one Mealy machine simulate the other one? We create formalism for simulation of Mealy machines. The injective s–morphism of the machine semigroups induces the simulation of machines [1]. We present the example of s–morphism such that it is not a homomorphism of semigroups. The story for the surjective s–morphisms is quite different. These are homomorphisms of semigroups but there exists the surjective s–morphism such that it does not induce the simulation.

Keywords: Mealy machine, simulation, machine semigroup, injective s–morphism, surjective s–morphisms.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1057033

References:

[1] J.Buls, I.Zandere. Injective Morphisms of the Machine Semigroups. Contributions to General Algebra 14, Proceedings of the Olomouc Conference 2002 (AAA64) and the Potsdam Conference 2003 (AAA65). Verlag Johannes Heyn, Klagenfurt, P. 15-19, 2004.
[2] Hartmanis J. On the State Assignment Problem for Sequential Machines I. IRE Transactions on Electronic Computers. Vol. EC-10, No.2(June), pp.157-165, 1961.
[3] Lallement G. Semigroups and Combinatorial Applications. John Wlley & Sons, New York, Chichester, Brisbane, Toronto, 1979.
[4] Plotkin B. I., Greenglaz I. Ja., Gvaramija A. A. Algebraic Structures in Automata and Databases Theory.World Scientific, Singapore, New Jersey, London, Hong Kong, 1992.
[5] .A. Buls. Ocenka dliny slova pri modelirovanii koneqnyh determinirovannyh avtomatov. Teori algoritmov i programm. Riga: LGU im. P. Stuqki, S. 50-63, 1986. (Russian)