852 search results - page 81 / 171 » entcs 2010 |
104
Voted
ENTCS
2002
15 years 11 days ago
2002
We show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category X, namely where X is...
105
Voted
ENTCS
2008
15 years 3 days ago
2008
We give a general method for showing that all numberings of certain effective algebras are recursively equivalent. The method is based on computable approximation-limit pairs. The...
102
Voted
ENTCS
2008
15 years 3 days ago
2008
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
115
Voted
ENTCS
2008
14 years 11 months ago
2008
In light of recent shift towards shared-memory systems in parallel explicit model checking, we explore relative advantages and disadvantages of shared versus private hash tables. ...
138
click to vote
ENTCS
2010
14 years 10 months ago
2010
We present a new variant of the Earley parsing algorithm capable of efficiently supporting context-free grammars with regular right hand-sides. We present the core state-machine d...