In the paper, we deal with PFAs with input strings of words.
we can derive the probability for PFAs computing strings of words by means of calculating these probabilities of PFAs recognizing strings of symbols (Theorem 1), and thus shows that PFAs for inputting strings of words can be transferred to PFAs computing the convention all strings of symbols, at the expense of more steps of computation, which may be called computation tractability.