Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by askeshavas
–1
votes
1
Peter Linz Edition 4 Exercise 3.3 Question 15 (Page No. 97)
Show that any regular grammar $G$ for which $L (G) ≠ Ø$ must have at least one production of the form $A → x$ where $A ∈ V$ and $x ∈ T^ *$.
Show that any regular grammar $G$ for which $L (G) ≠ Ø$ must have at least one production of the form $A → x$ where $A ∈ V$ and $x ∈ T^ *$.
365
views
answered
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
–1
votes
2
Peter Linz Edition 4 Exercise 3.3 Question 15 (Page No. 97)
Show that any regular grammar $G$ for which $L (G) ≠ Ø$ must have at least one production of the form $A → x$ where $A ∈ V$ and $x ∈ T^ *$.
Show that any regular grammar $G$ for which $L (G) ≠ Ø$ must have at least one production of the form $A → x$ where $A ∈ V$ and $x ∈ T^ *$.
365
views
answered
Apr 3, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-grammar
+
–
0
votes
3
Eigen Value
An orthogonal matrix A has eigen values 1, 2 and 4. What is the trace of the matrix
An orthogonal matrix A has eigen values 1, 2 and 4. What is the trace of the matrix
6.9k
views
answered
Jan 27, 2019
Linear Algebra
matrix
eigen-value
+
–
0
votes
4
self-doubt
Consider a binary tree T that has 50 leaf nodes. Then the number of nodes in T that have exactly ONE children are ______.
Consider a binary tree T that has 50 leaf nodes. Then the number of nodes in T that have exactlyONE children are ______.
1.0k
views
answered
Jan 23, 2019
DS
binary-tree
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
