Suppose that l is a subset of i and for some positive


Question: Suppose that L is a subset of I ∗ and for some positive integer n there are n strings in I ∗ such that every two of these strings are distinguishable with respect to L. Prove that every deterministic finite-state automaton recognizing L has at least n states.

Solution Preview :

Prepared by a verified Expert
Theory of Computation: Suppose that l is a subset of i and for some positive
Reference No:- TGS02373323

Now Priced at $10 (50% Discount)

Recommended (91%)

Rated (4.3/5)