6A grammar is ambiguous if:AIt has only terminalsBSome string has more than one parse treeCIt has no start symbolDIt generates nothingView AnswerDiscussWorkspaceReportSaveEasy
7Which regular expression describes all binary strings ending in 01?A0*1*B01(0 + 1)*C(0 + 1)*01D(01)*View AnswerDiscussWorkspaceReportSaveEasy
8Regular languages are recognised by:APushdown automata onlyBFinite automataCLinear bounded automata onlyDTuring machines onlyView AnswerDiscussWorkspaceReportSaveEasy
9The minimum number of states in a DFA accepting binary strings divisible by 3 is:A6B3C2D4View AnswerDiscussWorkspaceReportSaveEasy
10A language is decidable if:AIt is regular onlyBIt is infiniteCSome Turing machine accepts it but may loopDA Turing machine halts on every input and accepts exactly its stringsView AnswerDiscussWorkspaceReportSaveEasy