A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Non-deterministic Algebraic Structures for Soft Computing
[chapter]
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
doi:10.1007/978-3-642-21498-1_55
fatcat:mq662yp5xzbn5agvoaxxkbj62q