Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged language
1
votes
2
answers
1
Gradup topicwise question doubt
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)$\{a^m b^n|n>m, m≥0\}$ I select option C but it is wrong, correct answer is option D. I could not understand Gradup answer explanation.Please help me to rectify my fault.
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\}...
Sona Barman
324
views
Sona Barman
asked
May 24, 2018
Theory of Computation
theory-of-computation
language
of
grammar
+
–
1
votes
1
answer
2
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...
Arjun
1.1k
views
Arjun
asked
Nov 5, 2017
Theory of Computation
ugcnetcse-nov2017-paper3
theory-of-computation
language
+
–
0
votes
1
answer
3
Introduction to Automata and Compiler Design chapter1
I know this is trivial but verify !
I know this is trivial but verify !
Jason GATE
371
views
Jason GATE
asked
Feb 5, 2017
Theory of Computation
language
+
–
0
votes
1
answer
4
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}......
Jason GATE
308
views
Jason GATE
asked
Feb 5, 2017
Theory of Computation
countable
language
+
–
2
votes
1
answer
5
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
go_editor
3.7k
views
go_editor
asked
Jul 31, 2016
CO and Architecture
ugcnetcse-june2015-paper3
8085-microprocessor
assembly
language
non-gate
co-and-architecture
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register