Further remarks on the complexity of regulated rewriting
Fuzzy grammatical inference using neural network.
We have shown a model of fuzzy neural network that is able to infer the relations associated to the transitions of a fuzzy automaton from a fuzzy examples set. Neural network is trained by a backpropagation of error based in a smooth derivative [1]. Once network has been trained the fuzzy relations associated to the transitions of the automaton are found encoded in the weights.
Fuzzy systems and neural networks XML schemas for Soft Computing.
This article presents an XML[2] based language for the specification of objects in the Soft Computing area. The design promotes reuse and takes a compositional approach in which more complex constructs are built from simpler ones; it is also independent of implementation details as the definition of the language only states the expected behaviour of every possible implementation. Here the basic structures for the specification of concepts in the Fuzzy Logic area are described and a simple construct...
Games, complexity classes, and approximation algorithms.
Gardens of Eden and amenability on cellular automata
Gaussian Elimination is not Optimal.
Généralisation d'un résultat de Loxton et van der Poorten
Generalization of well-translation of formal languages
Generalizations of the standard travelling salesman problem
Generalized cancellation-and-permutation properties, regular languages and supports of rational series
Generalized grammatical categories in the sense of Kunze
Generalized identification experiments for finite deterministic automata
Generalized Nets Model of an E-Learning System Software Architecture
The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshko ff and Lubomir Tschakaloff , Sofi a, July, 2006.Component-based software engineering and software architecture are tightly connected areas in computer science. Software architecture presents the functionality of the system as decomposition into components, the properties of these components and the connectors between them. This paper illustrates a methodology for application...
Generalized pascal triangles: overview of new results
Generalized polar varieties and an efficient real elimination
Let be a closed algebraic subvariety of the -dimensional projective space over the complex or real numbers and suppose that is non-empty and equidimensional. In this paper we generalize the classic notion of polar variety of associated with a given linear subvariety of the ambient space of . As particular instances of this new notion of generalized polar variety we reobtain the classic ones and two new types of polar varieties, called dual and (in case that is affine) conic. We show that...
Generalizing substitution
It is well known that, given an endofunctor on a category , the initial -algebras (if existing), i.e., the algebras of (wellfounded) -terms over different variable supplies , give rise to a monad with substitution as the extension operation (the free monad induced by the functor ). Moss [17] and Aczel, Adámek, Milius and Velebil [2] have shown that a similar monad, which even enjoys the additional special property of having iterations for all guarded substitution rules (complete iterativeness),...
Generalizing Substitution
It is well known that, given an endofunctor H on a category C , the initial (A+H-)-algebras (if existing), i.e. , the algebras of (wellfounded) H-terms over different variable supplies A, give rise to a monad with substitution as the extension operation (the free monad induced by the functor H). Moss [17] and Aczel, Adámek, Milius and Velebil [12] have shown that a similar monad, which even enjoys the additional special property of having iterations for all guarded substitution rules (complete...
Generating functions and the satisfiability threshold.
Generating Networks of Splicing Processors
In this paper, we introduce generating networks of splicing processors (GNSP for short), a formal languages generating model related to networks of evolutionary processors and to accepting networks of splicing processors. We show that all recursively enumerable languages can be generated by GNSPs with only nine processors. We also show, by direct simulation, that two other variants of this computing model, where the communication between processors is conducted in different ways, have the same computational...
Generating Networks of Splicing Processors
In this paper, we introduce generating networks of splicing processors (GNSP for short), a formal languages generating model related to networks of evolutionary processors and to accepting networks of splicing processors. We show that all recursively enumerable languages can be generated by GNSPs with only nine processors. We also show, by direct simulation, that two other variants of this computing model, where the communication between processors...