I already mentioned this in lecture, and you may remember it ... but it's worth thinking through. This question was required for students in CIS 561 and optional extra credit for students in CIS 461.
L is the set of all sequences of one or more decimal digits in which each digit appears at most once. For example, "0152" is in L, and "520" is in L, but "9525" is not in L (because 5 is repeated).
Is L a regular language? If it is not regular, why not? If L is regular, how many states are in the smallest DFA that recognizes L?
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment