A Linear Algorithm for Testing Equivalence of Finite Automata.

Abstract

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)

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1971
Accession Number
AD0735159

Entities

People

  • John E. Hopcroft
  • Richard M. Karp

Organizations

  • Cornell University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Alphabets
  • Automata
  • Automation
  • California
  • Cooperation

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.