6111 search results - page 174 / 1223 » Time, Hardware, and Uniformity |
CONCUR
1998
Springer
14 years 2 months ago
1998
Springer
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
GD
1994
Springer
14 years 2 months ago
1994
Springer
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank ...
DLT
2010
13 years 12 months ago
2010
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...
FUIN
2008
13 years 10 months ago
2008
In this paper, we investigate the computational efficiency of gene rearrangement operations found in ciliates, a type of unicellular organisms. We show how the so-called guided re...
ICCAD
2007
IEEE
14 years 7 months ago
2007
IEEE
— Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples ...