Non-deterministic algebraic structures for soft computing

  • Authors:
  • I. P. Cabrera;P. Cordero;M. Ojeda-Aciego

  • Affiliations:
  • Dept. Matemática Aplicada, Universidad de Málaga, Spain;Dept. Matemática Aplicada, Universidad de Málaga, Spain;Dept. Matemática Aplicada, Universidad de Málaga, Spain

  • Venue:
  • IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 foundation of this theoretical model of computation are nondeterministic 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.