The computational graph can be of infinite size if there are no restrictions on possible configurations; indeed, it is easy to see that there are Turing machines which can reach arbitrarily large configurations.
It is also possible to have finite graphs: on Deterministic finite automaton with s states, for a given word of size n the configuration is composed of the position of the head and the current state.