Recognizability in Stochastic Monoids

A. Kalampakas, O. Louscou-Bozapalidou, S. Spartalis


Stochastic monoids and stochastic congruences are introduced and the syntactic stochastic monoid M L associated to a subset L of a stochastic monoid M is constructed. It is shown that M L is minimal among all stochastic epimorphisms h : M → M ′ whose kernel saturates L. The subset L is said to be stochastically recognizable whenever M L is finite. The so obtained class is closed under boolean operations and inverse morphisms.


recognizability, stochastic monoids, minimization

Full Text:



I.P. Cabrera, P. Cordero, M. Ojeda-Aciego, Non-deterministic Algebraic Structures for Soft Computing, Advances in Computational ntelligence, Lecture Notes in Computer Science 6692(2011) 437-444.

J. S. Golan, Semirings of Formal Series over Hypermonoids: Some Interesting Cases, Kyungpook Math. J. 36(1996) 107-111.

A. Kalampakas and O. Louskou-Bozapalidou, Syntactic Nondeterministic Monoids, submitted in Pure Mathematics and Applications.

O. Louskou-Bozapalidou, Stochastic Monoids, Applied Mathematical Sciences 3(2007) 443-446.


  • There are currently no refbacks.

Copyright (c) 2014 A. Kalampakas, O. Louscou-Bozapalidou, S. Spartalis

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Ratio Mathematica - Journal of Mathematics, Statistics, and Applications. ISSN 1592-7415; e-ISSN 2282-8214.