We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...
Jean Berstel, Luc Boasson, Olivier Carton, Isabell...
Extended multi bottom-up tree transducers are dened and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of ...
In this paper we consider the partial many-sorted first-order logic and its extension to the subsorted partial many-sorted first-order logic that underly the Casl specification fo...