recategorized by
1,561 views

1 Answer

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.
Answer:

Related questions

0 votes
0 votes
1 answer
1
admin asked Apr 2, 2020
632 views
The defining language for developing a formalism in which language definitions can be stated, is calledsyntactic meta languagedecidable languageintermediate languagehigh ...
0 votes
0 votes
0 answers
2
admin asked Apr 2, 2020
210 views
Find the area bounded by the curve $y=\sqrt{5-x^{2}}$ and $y=\mid x-1 \mid$$\dfrac{2}{0}(2\sqrt{6}-\sqrt{3})-\dfrac{5}{2}$$\dfrac{2}{3}(6\sqrt{6}+3\sqrt{3})+\dfrac{5}{2}$...
1 votes
1 votes
3 answers
3
admin asked Apr 2, 2020
799 views
Regular expression $(a \mid b)(a \mid b)$ denotes the set$\{a,b,ab,aa\}$$\{a,b,ba,bb\}$$\{a,b\}$$\{aa,ab,ba,bb\}$
2 votes
2 votes
1 answer
4
admin asked Apr 2, 2020
863 views
Two finite state machines are said to be equivalent if theyhave same number of stateshave same number of edgeshave same number of states and edgesrecognize same set of to...