E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
This paper is motivated by the design of AES. We consider a broader question of cryptanalysis of block ciphers having very good non-linearity and diffusion. Can we expect anyway, ...
—Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (P...
Ari Trachtenberg, David Starobinski, Sachin Agarwa...