A Computational Tool for Some Boolean Partial Maps

Authors

Silvia M. Sanahuja, Department of Mathematics, University of Castilla-La Mancha, 02071 Albacete, SpainFollow

Author Country (or Countries)

Spain

Abstract

This work is devoted to constructing a deterministic finite automaton whose states are particular types of order-preserving Boolean partial maps introduced by Bisi and Chiaselotti. The domains of such maps are subsets of a finite poset equipped with an idempotent and antitone map. These maps can be identified with certain linear systems of real inequalities and this automaton provides a computational model useful for building the global extensions of such maps.

Recommended Citation

M. Sanahuja, Silvia (2015) "A Computational Tool for Some Boolean Partial Maps," Applied Mathematics & Information Sciences: Vol. 09: Iss. 3, Article 5.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol09/iss3/5