GATE CS Applied Course

TOC Regular and non regular Languages


If L1: {a^nb^m,|n,n>=0} and L2:{a^p|p is prime} then is L1 intersection L2 regular. If not then why



Mritunjay Posted on Jan 28, 2020 03:22 PM

L1 is CFL and L2 is accepted by turning machine p is prime it doesn't give any pattern so L2 is not regular L2 is recursive intersection of L1 and L2 is recursive

surya Posted on Feb 05, 2020 14:39 PM

but a^nb^m m,n>=0 is regular

© 2020 - All rights are reserved- AAIC Technologies pvt ltd