Telecharger Cours

Introduction to the Theory of Computation Languages, Automata and ...

... 1), for all i such that 1 ? i ? n ? 1. When n = 0, we must have u = v, and the path (u, ?, u) is called the null path from u to u. The number n is the ...



Download