retagged by
506 views

1 Answer

0 votes
0 votes
Reg ∩cfl

Regular Intersection with cfl is cfl acc to closure table properties .

Now the thing come when to use above matter it is used especially when  language is not defined explicitly . So use closure table .

When language is directly given than result will be .

a^nb^n ∩∅=∅ ( which is regular so cfl also  )

a^nb^n ∩⋲*=a^nb^n (which is cfl but not regular)
edited by

Related questions

3 votes
3 votes
2 answers
1
1 votes
1 votes
1 answer
2
0 votes
0 votes
1 answer
3
Shaina Singh asked Jul 31, 2023
215 views
Convert this language to Push Down Automata – {a^n u | u ∈ {a, b}*, |u| = n, n ≥ 0}