Register

derive a language from a grammar

• retagged by
297 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.4k
views
1 answers
0 votes
Garrett McClure asked Sep 7, 2017
1,434 views
Computation and Automata - Constructing a DFA from a Language
Find a DFA for the following language on Σ = {0, 1}L = {w : the value of w, interpreted as a binary representation of an integer is zero modulo five}. For example, 0101 and 1111, ... 5) mod 5, (2n + 1) mod 5 = [(2n mod 5) + 1] mod 5.
User Avatar
3.2k
views
1 answers
3 votes
Don't you worry asked Jun 8, 2016
3,210 views
Can a Non-Regular Grammar Produce's Regular Language ?.Give an Exp.
User Avatar
428
views
2 answers
3 votes
Jiten008 asked Oct 24, 2023
428 views
TOC - Self Doubt
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
User Avatar
535
views
1 answers
0 votes
admin asked May 4, 2019
535 views
Michael Sipser Edition 3 Exercise 2 Question 13 (Page No. 156)
Let $G = (V, \Sigma, R, S)$ be the following grammar. $V = \{S, T, U\}; \Sigma = \{0, \#\};$ and $R$ is the set of rules$:$ ... Describe $L(G)$ in English.Prove that $L(G)$ is not regular$.$
User Avatar
Link Copied!