In this paper we study distributions on k-ary trees, which from the point of doing statistics on trees, they behave in a more realistic way than the usual uniform distribution. In particular, we choose a distribution for ...

It is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate -- the query complexity -- the number of membership and equivalence queries ...

The rst part of the XX century saw the development of the digital computer and the eld of computer science. In the present paper, we sketch our vision of that period and of the role that Alan Turing and some of his ...

In this paper we survey results on several graph layout problems from an algorithmic point of view. Graph layout problems are a particular class of combinatorial optimization problems whose goal is to find a linear layout ...

We propose several variations of the adversarial queueing model. The priority model takes into account the case in which the packets can have different priorities, assigned by the adversary at injection time. The ...

In this survey we compare several known variants of the algorithm for learning deterministic finite automata via membership and equivalence queries. We believe that our presentation makes it easier to understand what ...