equivalence of regular languages

avatar
Created by
Francisca Portugal

Cards (1)

  • VERIFYING EQUIVALENCE OF REGULAR LANGUAGES
    Given two representations for languages L and M:
    • Convert each to a DFA and minimize
    • If the minimized DFAs are identical (disregarding state names), then L = M