Non-deterministic Algebraic Structures for Soft Computing [chapter]

I. P. Cabrera, P. Cordero, M. Ojeda-Aciego
2011 Lecture Notes in Computer Science  
The need of considering non-determinism in theoretical computer science has been claimed by several authors in the literature. The notion of non-deterministic automata as a formal model of computation is widely used, but the specific study of non-determinism is useful, for instance, for natural language processing, in describing interactive systems, for characterizing the flexibility allowed in the design of a circuit or a network, etc. The most suitable structures for constituting the
more » ... n of this theoretical model of computation are non-deterministic algebras. The interest on these generalized algebras has been growing in recent years, both from a crisp and a fuzzy standpoint. This paper presents a survey of these structures in order to foster its applicability for the development of new soft computing techniques.
doi:10.1007/978-3-642-21498-1_55 fatcat:mq662yp5xzbn5agvoaxxkbj62q