315 search results - page 12 / 63 » What is algebraic in process theory |
FSEN
2009
Springer
14 years 1 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
3DPH
2009
13 years 4 months ago
2009
We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in ...
FOSSACS
2006
Springer
13 years 10 months ago
2006
Springer
We prove that the equational theory of the process algebra BCCSP modulo completed simulation equivalence does not have a finite basis. Furthermore, we prove that with a finite alph...
COGSCI
2011
13 years 1 months ago
2011
This article examines cognitive process models of human sentence comprehension based on the idea of informed search. These models are rational in the sense that they strive to qui...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...