For example, is this language regular or context-free language? On the one hand n can't be smaller than m but on the other hand you can't count n and m. {(ab)^n (ab)^m | n>=m>=0}

I am provided with a NFA and I need to use a data structure (I can not use recursive descent parser) for storing it. Once the NFA is stored in a data structure I am given a string to check if the stri...

This the question : L = { vwv : w,v ∈ {a,b}* , |v| = 2 } I draw it until W cames up idk what to do ! this is my way :

I need to build a state machine and write a control program to recognise a set of strings of zeros and ones, in which there are three zeros between each occurrence of one. Below is my code which is no...