Register

peter linz

1,171 views
0 0 votes
The language L1={a^n b^n} union {b}

The language L2={a^n b^n} union {a}

They both are deterministic CFL.

Am i right?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · circular queueNext → · probability question
← Previous in category · Relationship b/w clo...Next in category → · Turing machine
Position:
Show:

Related questions

3 3 votes
0 0 answers
388
388 views
Deepak Poonia asked Nov 20, 2024
388 views
Peter Linz Edition 6 Exercise 7.3 Question 14 (Page No. 207)
Show that $L = \{a^nb^m,n< 2m \}$ is a deterministic context-free language.
1 1 vote
0 0 answers
1.2k
1.2k views
Naveen Kumar 3 asked Jun 25, 2019
1,165 views
Peter Linz Edition 4 Exercise 8.1 Question 8 (Page No. 212)
Determine whether or not the following languages are context-free.(a) $L=$ {$a^nww^Ra^n : n ≥ 0, w ∈$ {$a,b$}*}(b) $L=$ {$a^nb^ja^nb^j : n ≥ 0, j ≥ 0$}.(C) $L=$ {$a^nb^ja...
2 2 votes
2 2 answers
1.3k
1.3k views
Naveen Kumar 3 asked Jun 25, 2019
1,299 views
Peter Linz Edition 4 Exercise 8.1 Question 5 (Page No. 212)
Is the language L = {$a^nb^m : n = 2^m$} context-free?
1 1 vote
2 2 answers
922
922 views
Naveen Kumar 3 asked Jun 25, 2019
922 views
Peter Linz Edition 4 Exercise 8.1 Question 1 (Page No. 212)
Show that the language $L=${$a^nb^nc^m,n\neq m$} is not context-free.