Sciweavers

762 search results - page 2 / 153
» Intercode Regular Languages
Sort
View
LATA
2011
Springer
12 years 8 months ago
Networks of Evolutionary Processors with Subregular Filters
In this paper we propose a hierarchy of classes of languages, generated by networks of evolutionary processors with the filters in several special classes of regular sets. More p...
Jürgen Dassow, Florin Manea, Bianca Truthe
LATA
2011
Springer
12 years 8 months ago
Classifying Regular Languages via Cascade Products of Automata
Abstract. Building on the celebrated Krohn-Rhodes Theorem we characterize classes of regular languages in terms of the cascade decompositions of minimal DFA of languages in those c...
Marcus Gelderie
LATA
2012
Springer
12 years 23 days ago
Conservative Groupoids Recognize Only Regular Languages
The notion of recognition of a language by a finite semigroup can be generalized to recognition by finite groupoids, i.e. sets equipped with a binary operation ‘·’ which is ...
Danny Dubé, Mario Latendresse, Pascal Tesso...
ICDT
2012
ACM
226views Database» more  ICDT 2012»
11 years 7 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
NC
2010
137views Neural Networks» more  NC 2010»
12 years 12 months ago
On the regularity of circular splicing languages: a survey and new developments
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focu...
Paola Bonizzoni, Clelia de Felice, Gabriele Fici, ...