in Theory of Computation
486 views
0 votes
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?
in Theory of Computation
486 views

4 Comments

yes mam...

either you have 1 a ===> accepted ( due to final state )

or n a's then check n b's ===> accepted
1
1
you can't have extra b....
1
1
ok yes
0
0

Please log in or register to answer this question.

Related questions