LATA
2010
Springer
13 years 3 months ago
2010
Springer
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...
LATA
2010
Springer
13 years 3 months ago
2010
Springer
LATA
2010
Springer
13 years 7 months ago
2010
Springer
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...
LATA
2010
Springer
13 years 8 months ago
2010
Springer
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...
LATA
2010
Springer
13 years 8 months ago
2010
Springer
Erd
LATA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we...
LATA
2010
Springer
13 years 9 months ago
2010
Springer
LATA
2010
Springer
13 years 9 months ago
2010
Springer
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...
LATA
2010
Springer
13 years 9 months ago
2010
Springer
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...
LATA
2010
Springer
13 years 11 months ago
2010
Springer
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...