Sciweavers

Share
LATA
2010
Springer
12 years 8 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
12 years 8 months ago
Restarting Automata with Structured Output And Functional Generative Description
Martin Plátek, František Mráz, Markéta Lopatko...
LATA
2010
Springer
13 years 18 days ago
Avoidable Binary Patterns in Partial Words
The problem of classifying all the avoidable binary patterns in words has been completely solved (see Chapter 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge Universi...
Francine Blanchet-Sadri, Robert Mercas, Sean Simmo...
LATA
2010
Springer
13 years 1 months ago
Variable Automata over Infinite Alphabets
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
Sarai Sheinvald, Orna Grumberg, Orna Kupferman
LATA
2010
Springer
13 years 1 months ago
Abelian Square-Free Partial Words
Erd
Francine Blanchet-Sadri, Jane Kim, Robert Mercas, ...
LATA
2010
Springer
13 years 2 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 2 months ago
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
Christophe Costa Florêncio, Henning Fernau
LATA
2010
Springer
13 years 2 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...
LATA
2010
Springer
13 years 4 months ago
Operator Precedence and the Visibly Pushdown Property
Operator precedence languages, designated as Floyd’s Languages (FL) to honor their inventor, are a classical deterministic context-free family. FLs are known to be a boolean fami...
Stefano Crespi-Reghizzi, Dino Mandrioli
books