Sciweavers

24 search results - page 4 / 5
» lata 2010
Sort
View
LATA
2010
Springer
14 years 3 months ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
LATA
2010
Springer
13 years 4 months ago
Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...
Fernando Rosa Velardo, Giorgio Delzanno
LATA
2010
Springer
14 years 18 days ago
Three Learnable Models for the Description of Language
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
Alexander Clark
LATA
2010
Springer
13 years 10 months ago
Simplifying Regular Expressions. A Quantitative Perspective
Abstract. We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we...
Hermann Gruber and Stefan Gulan
LATA
2010
Springer
13 years 11 months ago
A Randomized Numerical Aligner (rNA)
With the advent of new sequencing technologies able to produce an enormous quantity of short genomic sequences, new tools able to search for them inside a references sequence genom...
Alberto Policriti, Alexandru I. Tomescu, Francesco...