16Regular languages are recognised by:ALinear bounded automata onlyBFinite automataCPushdown automata onlyDTuring machines onlyView AnswerDiscussWorkspaceReportSaveEasy
17A language is decidable if:AIt is infiniteBIt is regular onlyCA Turing machine halts on every input and accepts exactly its stringsDSome Turing machine accepts it but may loopView AnswerDiscussWorkspaceReportSaveEasy
18An ε-NFA allows transitions:AOnly on the symbol ε printed in inputBOnly to final statesCOnly to the start stateDWithout consuming an input symbolView AnswerDiscussWorkspaceReportSaveEasy
19A DFA with n states over alphabet Σ has how many transitions?An²B2ⁿCn × |Σ|Dn + |Σ|View AnswerDiscussWorkspaceReportSaveMedium