434 search results - page 36 / 87 » Monadic Bounded Algebras |
MST
2011
13 years 4 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
LPAR
2010
Springer
13 years 7 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
DIMACS
1996
13 years 11 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
EMSOFT
2004
Springer
14 years 3 months ago
2004
Springer
In reactive systems, execution is driven by external events to which the system should respond with appropriate actions. Such events can be simple, but systems are often supposed ...
FSE
2004
Springer
14 years 3 months ago
2004
Springer
We apply the algebraic attacks on stream ciphers with memories to the summation generator. For a summation generator that uses n LFSRs, an algebraic equation relating the key strea...