96 search results - page 14 / 20 » On Several Proofs of the Recognizability Theorem |
116
click to vote
COCO
1997
Springer
15 years 1 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
APLAS
2001
ACM
15 years 1 months ago
2001
ACM
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
APLAS
2003
ACM
15 years 1 months ago
2003
ACM
Abstract. Much work has been done in verifying a compiler specification, both in hand-written and mechanical proofs. However, there is still a gap between a correct compiler specif...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected...
CCCG
2010
14 years 11 months ago
2010
A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and ...