A linear algorithm for testing equivalence of finite automata

Front Cover
Defense Technical Information Center, 1971 - Computers - 7 pages
0 Reviews
An algorithm is given for determining if two finite automata with start states are equivalent. The asymptotic running time of the algorithm is bounded by a constant times the product of the number of states of the larger automation with the size of the input alphabet. (Author).

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Common terms and phrases

Bibliographic information