Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
In this paper we describe a trellis representation of variable length coded data which is capable of being used for bit-level or symbol-level maximum a posteriori (MAP) decoding o...
—It is well known that symbol timing offsets larger than the cyclic prefix as well as carrier frequency offsets between transmitter and receiver stations destroy the orthogonali...
Classically, cognition assumes that the underlying mechanisms of thinking are based on symbol manipulation processes. This assumption has several drawbacks, such as the issue of w...
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...