1Which machine recognises recursively enumerable languages?APushdown automatonBMealy machineCFinite automatonDTuring machineView AnswerDiscussWorkspaceReportSaveEasy
2Chomsky Normal Form allows productions of the form:AA → aBc onlyBA → BC or A → aCAny formDA → ε onlyView AnswerDiscussWorkspaceReportSaveEasy
3A DFA with n states over alphabet Σ has how many transitions?An × |Σ|B2ⁿCn²Dn + |Σ|View AnswerDiscussWorkspaceReportSaveMedium
4Which regular expression describes all binary strings ending in 01?A(01)*B0*1*C01(0 + 1)*D(0 + 1)*01View AnswerDiscussWorkspaceReportSaveEasy
5How many states does a minimal DFA need for binary strings with an even number of 0s and an even number of 1s?A4B2C3D8View AnswerDiscussWorkspaceReportSaveMedium