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 17 Next

Displaying 321 – 340 of 948

Showing per page

Free group languages : rational versus recognizable

Pedro V. Silva (2004)

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

We provide alternative proofs and algorithms for results proved by Sénizergues on rational and recognizable free group languages. We consider two different approaches to the basic problem of deciding recognizability for rational free group languages following two fully independent paths: the symmetrification method (using techniques inspired by the study of inverse automata and inverse monoids) and the right stabilizer method (a general approach generalizable to other classes of groups). Several...

Free group languages: Rational versus recognizable

Pedro V. Silva (2010)

RAIRO - Theoretical Informatics and Applications

We provide alternative proofs and algorithms for results proved by Sénizergues on rational and recognizable free group languages. We consider two different approaches to the basic problem of deciding recognizability for rational free group languages following two fully independent paths: the symmetrification method (using techniques inspired by the study of inverse automata and inverse monoids) and the right stabilizer method (a general approach generalizable to other classes of groups). Several...

Generalizing substitution

Tarmo Uustalu (2003)

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

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

Tarmo Uustalu (2010)

RAIRO - Theoretical Informatics and Applications

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

Currently displaying 321 – 340 of 948