1 votes 1 votes If every string of a language can be determined, whether it is legal or illegal in finite time, the language is called decidable undecidable interpretive non-deterministic Theory of Computation nielit2016mar-scientistc theory-of-computation identify-class-language + – admin asked Apr 2, 2020 recategorized Oct 28, 2020 by Krithiga2101 admin 1.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes "If every string of a language can be determined, whether it is legal or illegal in finite time" It means the machine will always halt, so it will be decidable. Hence A is correct. smsubham answered Apr 2, 2020 smsubham comment Share Follow See 1 comment See all 1 1 comment reply Nitinkumar.097 commented Feb 15, 2021 reply Follow Share "If every string of a language can be determined, whether it is legal or illegal in finite time" it says every string belonging to language can be determined (i.e. accept in halt if string belongs to language) nothing is said about string which are not in language, so it may reject and halt or loop forever, it seems semi-decidable. 0 votes 0 votes Please log in or register to add a comment.