11An ε-NFA allows transitions:AOnly to the start stateBOnly to final statesCOnly on the symbol ε printed in inputDWithout consuming an input symbolView AnswerDiscussWorkspaceReportSaveEasy
12The halting problem is:ARegularBSolvable by a DFACUndecidableDDecidable in polynomial timeView AnswerDiscussWorkspaceReportSaveEasy
13Chomsky Normal Form allows productions of the form:AA → BC or A → aBAny formCA → aBc onlyDA → ε onlyView AnswerDiscussWorkspaceReportSaveEasy
14A language is decidable if:ASome Turing machine accepts it but may loopBIt is infiniteCIt is regular onlyDA Turing machine halts on every input and accepts exactly its stringsView AnswerDiscussWorkspaceReportSaveEasy
15Regular languages are closed under:AUnion, concatenation, Kleene star, intersection and complementBUnion onlyCNone of the operationsDConcatenation onlyView AnswerDiscussWorkspaceReportSaveEasy