Question 6885 – Theory-of-Computation
November 7, 2023Question 15353 – DSSSB PGT 2021
November 7, 2023Question 7452 – Theory-of-Computation
Define the language INFINITEDFA ≡ {A|A is a DFA and L(A) is an infinite language}, where A denotes the description of the deterministic finite automata (DFA). Then which of the following about INFINITEDFA is TRUE:
Correct Answer: C
It is regular.
It is context-free but not regular.
It is Turing decidable (recursive).
It is Turing recognizable but not decidable.
Its complement is Turing recognizable but it is not decidable.
Subscribe
Login
0 Comments