Non-redundant random generation algorithms for weighted context-free languages

And finally, since one can build a random Motzkin word of size n with a fixed number k of x symbols in linear time, the overall average complexity of the method is linear in

Its bit complexity is in O(qn 2 ) space and time for the preprocessing stage and O(n 2 ) for the generation, where n denotes the length of the path to be generated, and q denotes

the set of ⌈(3 log n)/ log 2⌉ vertices with the highest degrees can be used to test whether two random graphs are isomorphic (in fact, they provided an O(n 2 ) algorithm to do it),

In the next sections, we prove that for a regular K-expression of size n there exists a common follow polynomials automaton with O(n log 2 (n)) transitions and O(n) states..

In this section we prove the main resuit of this paper which states that if every strong itérative pair of a context-free language K is very degenerate, then K is a regular

Let Y t be the potential at step t ( Y t ∈ [0, 1] ) and K t be the current number of consecutive players whose best response did not change the current potential ( K t ∈ {1, 2,..

As a reminder, this thesis is focused on essentially four questions related to the following ideas: 1) identify the properties of instances (DAGs and cost matrices), 2) analyze

In [85], a strategy was given which completes collaborative exploration with return of any tree with a team of k agents in O(D + n/ log k) time steps, using a communication model