Register

NIELIT 2016 MAR Scientist C - Section C: 14

• recategorized by
1,675 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.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

734
views
1 answers
0 votes
admin asked Apr 2, 2020
734 views
NIELIT 2016 MAR Scientist C - Section C: 15
The defining language for developing a formalism in which language definitions can be stated, is calledsyntactic meta languagedecidable languageintermediate languagehigh level language
User Avatar
247
views
0 answers
0 votes
admin asked Apr 2, 2020
247 views
NIELIT 2016 MAR Scientist C - Section B: 14
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}$2(\sqrt{6}-\sqrt{3})-5$\dfrac{2}{3}(\sqrt{6}-\sqrt{3})+5$
User Avatar
871
views
3 answers
1 votes
admin asked Apr 2, 2020
871 views
NIELIT 2016 MAR Scientist C - Section C: 17
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\}$
User Avatar
921
views
1 answers
2 votes
admin asked Apr 2, 2020
921 views
NIELIT 2016 MAR Scientist C - Section C: 32
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 tokens
User Avatar
Link Copied!