467 search results - page 39 / 94 » Roadmap of Infinite Results |
IPL
2008
13 years 9 months ago
2008
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduced by Hennessy and Milner in the early 1980s, over basic CCS with the divergent ...
TCS
2008
13 years 9 months ago
2008
We prove that it is decidable whether a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple ...
TCS
2008
13 years 9 months ago
2008
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
JCT
2002
13 years 8 months ago
2002
In partition theory and q-series, one often seeks identities between series and infinite products. Using a recent result of Zagier, we obtain such identities for every positive int...
FUIN
2010
13 years 6 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...