Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
Abstract. The paper introduces a collection of knowledge representation languages, V(C), parametrised over a class C of constraints. V(C) is an extension of both CR-Prolog and CASP...
Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...
— For decoding low-density parity-check (LDPC) codes on discrete memoryless channels, a method to quantize messages and to find message-passing decoding functions for the variab...
Brian M. Kurkoski, Kazuhiko Yamaguchi, Kingo Kobay...
Programmable logic arrays (PLAs) present an alternative to logic-gate based design. We propose the transistor level structure of a PLA for single-rail asynchronous applications. T...