Section: New Results

Synchronous Circuits

  • Followed up on J. Vuillemin's result that the XOR variant of non-deterministic automata can be efficiently minimized [65] , we explore this newly opened branch of computational automata theory. One contribution is a Decision Diagram for Boolean functions which has minimal dimension: this is appealing for both the verification and synthesis of memory-less circuits. Parts of this recent work were presented at the Boole ANR cooperation [8] and Synchron 2011.

  • An extension of Boolean Decison Diagrams to integer representation and operations is given in [66] : we pursue software experimentations with arithmetics on such gigantic (yet sparse) numbers.

  • The paper [32] was translated to English from the 1974 original and published in honor of Gilles Kahn.