This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Define a formal language as a set of strings over an alphabet, including finite and infinite languages.
You've completed the free preview. Subscribe to unlock every lesson in every course.