Category "regular-language"

Automata - Regular Expression (Union Case)

Automata 1) Recognizes strings with at least 2 a Regular Expression = b*ab*a(a+b)* Automata 2) Recognizes strings with at least 2 b Regular Expression = a*ba*b(

How L={ww^Rx| where w, x belongs to {a,b}^* } is a regular language?

I have understood that L={wxw^r|w,x belongs to {a,b}^* } is regular because it turns out to be the pattern of starting and ending with same symbol but I am not

How can I add an epsilon move to FSM using Python?

I am using the greenery module to implement an FSM: from greenery import fsm, lego E, O = range(2) z, o = '0', '1' # Create the FSM machine = fsm.fsm( al

Regular expression for words not starting or ending with vowels?

I used this regex: ^[aeiou](\w|\s)*[aeiou]$ for words starting and ending with vowels and it works fine. But when I use this regex: ^[^aeiou](\w|\s)*[^aeiou]$