325 search results - page 35 / 65 » Proofs of Restricted Shuffles |
CALCO
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
VMCAI
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
ACSD
2005
IEEE
14 years 3 months ago
2005
IEEE
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...
ADAEUROPE
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The Ravenscar Profile is a restricted subset of the Ada tasking model, designed to meet the requirements of producing analysable and deterministic code. A central featur...
CIE
2005
Springer
14 years 3 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...