Language Identify: Examples


Now we consider some various comparisons as below:


All language above has one infinite comparison and in all cases, push and pop are cleared means we can solve by a single use of the stack. 


All are Deterministic Context-Free Language (DCFL), but not Regular Language.



So, in that case, it is DCFL because there is one infinite comparison, and push and pop are clear.