645 views

1 Answer

Position:
Show:

Related questions

0 0 votes
1 1 answer
819
819 views
Jason GATE asked Feb 5, 2017
819 views
I know this is trivial but verify !
1 1 vote
2 answers 2 answers
732
732 views
Sona Barman asked May 24, 2018
732 views
Identify the language generated by the following grammar:$S->AB$$A->aAb|\epsilon$$B->bB|b$(A)$\{a^m b^n|n≥m, m>0\}$(B)$\{a^m b^n|n≥m, m≥0\}$(C)$\{a^m b^n|n>m, m>0\}$(D)$\...
1 1 vote
1 1 answer
1.5k
1.5k views
Arjun asked Nov 5, 2017
1,487 views
The language $L =\{a^i \: b \: c^i \mid i \geq 0\}$ over the alphabet $\{a, b, c\}$ isregular language Not a deterministic context free language but a context free langua...
2 2 votes
1 answers 1 answer
4.5k
4.5k views
go_editor asked Jul 31, 2016
4,504 views
The RST 7 instruction in 8085 microprocessor is equal toCALL 0010 HCALL 0034 HCALL 0038 HCALL 003C H