All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3 Next

Displaying 41 – 60 of 138

Showing per page

Extending regular expressions with homomorphic replacement

Henning Bordihn, Jürgen Dassow, Markus Holzer (2010)

RAIRO - Theoretical Informatics and Applications

We define H- and EH-expressions as extensions of regular expressions by adding homomorphic and iterated homomorphic replacement as new operations, resp. The definition is analogous to the extension given by Gruska in order to characterize context-free languages. We compare the families of languages obtained by these extensions with the families of regular, linear context-free, context-free, and EDT0L languages. Moreover, relations to language families based on patterns, multi-patterns,...

Free Term Algebras

Grzegorz Bancerek (2012)

Formalized Mathematics

We interoduce a new characterization of algebras of normal forms of term rewriting systems [35] as algerbras of term free in itself (any function from free generators into the algebra generates endomorphism of the algebra). Introduced algebras are free in classes of algebras satisfying some sets of equalities. Their universes are subsets of all terms and the denotations of operation symbols are partially identical with the operations of construction of terms. These algebras are compiler algebras...

Fuzzy grammatical inference using neural network.

Armando Blanco, A. Delgado, M. Carmen Pegalajar (1998)

Mathware and Soft Computing

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.

Generating Networks of Splicing Processors

Jürgen Dassow, Florin Manea, Bianca Truthe (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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

Jürgen Dassow, Florin Manea, Bianca Truthe (2012)

RAIRO - Theoretical Informatics and Applications

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...

Gramáticas discriminantes y funciones discriminantes lineales generalizadas.

Ana García Fornes, Antonio Ruiz Calomarde, Francisco Casacuberta Nolla, Enrique Vidal Ruiz (1989)

Qüestiió

Las Gramáticas Discriminantes constituyen una aproximación para la clasificación de frases generadas por Gramáticas cuando la presencia de ruidos y distorsiones hace difícil la aplicación de las Técnicas usuales de Análisis Sintáctico. Sin embargo, la formulación original (Filipski 80) presenta una restricción pues las gramáticas características deben ser las mismas para todas las clases. En este trabajo se presenta una solución al problema, mediante la aplicación de una Extensión de las Funciones...

Hierarchies of weakly monotone restarting automata

František Mráz, Friedrich Otto (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

It is known that the weakly monotone restarting automata accept exactly the growing context-sensitive languages. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.

Hierarchies of weakly monotone restarting automata

František Mráz, Friedrich Otto (2010)

RAIRO - Theoretical Informatics and Applications

It is known that the weakly monotone restarting automata accept exactly the growing context-sensitive languages. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.

Indexed counter languages

J. Duske, M. Middendorf, R. Parchmann (1992)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Induction and decision procedures.

Deepak Kapur, Jürgen Giesl, Mahadevan Subramaniam (2004)

RACSAM

Mechanization of inductive reasoning is an exciting research area in artificial intelligence and automated reasoning with many challenges. An overview of our work on mechanizing inductive reasoning based on the cover set method for generating induction schemes from terminating recursive function definitions and using decision procedures is presented. This paper particularly focuses on the recent work on integrating induction into decision procedures without compromising their automation.

Inference of fuzzy regular grammars from examples.

Inmaculada Fortes, Rafael Morales, José Luis Pérez de la Cruz, Francisco Triguero, M. A. Comino (1999)

Mathware and Soft Computing

Let us consider the following situation: An oracle provides us with a finite set of examples considered as words belonging to a regular language. This oracle is not available again. In this paper we study a new and general inference algorithm of fuzzy regular grammars based on this set of words. This algorithm is created by adapting a process discovery method. The main issues in the adaptation are the development of a fuzzy version, the assignation of membership degrees to each production in the...

Infinite periodic points of endomorphisms over special confluent rewriting systems

Julien Cassaigne, Pedro V. Silva (2009)

Annales de l’institut Fourier

We consider endomorphisms of a monoid defined by a special confluent rewriting system that admit a continuous extension to the completion given by reduced infinite words, and study from a dynamical viewpoint the nature of their infinite periodic points. For prefix-convergent endomorphisms and expanding endomorphisms, we determine the structure of the set of all infinite periodic points in terms of adherence values, bound the periods and show that all regular periodic points are attractors.

Iteration of rational transductions

Alain Terlutte, David Simplot (2010)

RAIRO - Theoretical Informatics and Applications

The purpose of this paper is to show connections between iterated length-preserving rational transductions and linear space computations. Hence, we study the smallest family of transductions containing length-preserving rational transductions and closed under union, composition and iteration. We give several characterizations of this class using restricted classes of length-preserving rational transductions, by showing the connections with "context-sensitive transductions" and transductions associated...

Currently displaying 41 – 60 of 138