Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Theory of Computation:
Recent questions tagged theory-of-computation
0
votes
0
answers
121
Undecidability Doubt
If G is a CFG then L(G) = (Sigma)* is Decidable or Undecidable? The reference where I solved this question says this is an Undecidable problem! But I think it's Decidable . Help would be appreciated.
If G is a CFG then L(G) = (Sigma)* is Decidable or Undecidable?The reference where I solved this question says this is an Undecidable problem! But I think it's Decidable ...
Sparsh-NJ
224
views
Sparsh-NJ
asked
Aug 6, 2023
Theory of Computation
theory-of-computation
decidability
+
–
0
votes
0
answers
122
self doubt
Let Σ and ∆ be any two alphabets. In this question, we consider maps h : Σ∗ → ∆∗ that satisfy the following properties: (I) h(e) = e, (II) h(uv) = h(u)h(v) for any pair of words u, v ∈ Σ∗. Such maps are uniquely determined by their values on letters in Σ, since for w = a1 ... , b}∗ satisfies the properties (I) and (II), with h(0) = aa and h(1) = b. (a) Compute h(00), h(110) and h(10110).
Let Σ and ∆ be any two alphabets. In this question, we consider maps h : Σ∗ → ∆∗ that satisfy the following properties: (I) h(e) = e, (II) h(uv) = h(u)h(v) fo...
Shaina Singh
143
views
Shaina Singh
asked
Aug 5, 2023
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
123
Theory of Computation
Construct pushdown automata that accept each of the following languages :- (i) {a^nu ∈ {a, b}∗| |u| = n, n ≥ 0} ⊆ {a, b}∗
Construct pushdown automata that accept each of the following languages :-(i) {a^nu ∈ {a, b}∗| |u| = n, n ≥ 0} ⊆ {a, b}∗
Shaina Singh
155
views
Shaina Singh
asked
Aug 5, 2023
Theory of Computation
theory-of-computation
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
155
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
