Recognizability in Stochastic Monoids

Authors

  • A. Kalampakas Department of Production Engineering and Management, Democritus University of Thrace, 67100, Xanthi, Greece
  • O. Louscou-Bozapalidou Section of Mathematics and Informatics, Technical Institute of West Macedonia, 50100, Kozani, Greece
  • S. Spartalis Department of Production Engineering and Management, Democritus University of Thrace, 67100, Xanthi, Greece

Keywords:

recognizability, stochastic monoids, minimization

Abstract

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.

References

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.

Downloads

Published

2014-06-30

Issue

Vol. 26 (2014)

Section

Volume 26-2014

License

This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:

  • Free access for all users worldwide
  • Increased visibility and readership
  • Rapid publication
  • No spatial constraints
  • Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)

Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified. 
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.