Lecture12-1_Part15 - • Deciding whether a language is...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Now we turn do deal with some problems related to regular and CF Languages. Typical problems are: Deciding whether a DFA accepts a language.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: • Deciding whether a language is empty. • Deciding whether two languages are equal, etc. Decision Problems on Automatons 15...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online