I am studying pushdown automata and I am working on a problem that asks to generate a PDA that accepts the following regular languages:
Intersection of L1 and L2
L1 = L (aaa* bab)
L2 = L (aab* aba)
I can't tell if this is even possible because I don't see any common string that would be in both languages.
If it is not possible how should I formally state so? I am brand new to PDAs.