The tree width of an alternating finite automaton (AFA) measures the parallelism in all computations AFA on a given input. maximal existential (respectively, universal) A string w number choices parallel universal branches) one computation w. We give polynomial time algorithms deciding finiteness AFA’s and width. Also we algorithm that for with decides whether or not is finite. Finiteness decid...