Register

Introduction to Automata and Compiler Design chapter1

383 views

1 Answer

0 votes
0 votes
Option C.

As there are no transitions on input symbols, so input is being accepted except epsilon.

// Set of input symbols cannot be empty.

If the state would jave been non-final then , option B would have been correct.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Jason GATE asked Feb 5, 2017
318 views
Introduction to Automata and Compiler Design Chapter 1
IF I TAKE L={a^p | where p is prime}......
IF I TAKE L={a^p | where p is prime}......
User Avatar
1 votes
1 votes
1 answer
3
Arjun asked Nov 5, 2017
1,139 views
UGC NET CSE | November 2017 | Part 3 | Question: 24
The language $L =\{a^i \: b \: c^i \mid i \geq 0\}$ over the alphabet $\{a, b, c\}$ is regular language Not a deterministic context free language but a context free language Recursive and is a deterministic context free language Not recursive
The language $L =\{a^i \: b \: c^i \mid i \geq 0\}$ over the alphabet $\{a, b, c\}$ isregular languageNot a deterministic context free language but a context free languag...
User Avatar
2 votes
2 votes
1 answer
4
go_editor asked Jul 31, 2016
3,732 views
UGC NET CSE | Junet 2015 | Part 3 | Question: 3
The RST 7 instruction in 8085 microprocessor is equal to CALL 0010 H CALL 0034 H CALL 0038 H CALL 003C H
The RST 7 instruction in 8085 microprocessor is equal toCALL 0010 HCALL 0034 HCALL 0038 HCALL 003C H
User Avatar
Link Copied!