Most sources, such as http://www.cs.may.ie/staff/jpower/Courses/Previous/parsing/node5.html, suggest that the Kleene closure be constructed with 4 nodes. Why can't it be constructed with just 2, a...

I read this in a book on computability: (Kleene's Theorem) A language is regular if and only if it can be obtained from finite languages by applying the three operations union, concatenation, ...

I read that every Non-deterministic Finite Automaton (NFA) can be transferred into a Deterministic Finite Automaton (DFA). Can this be done for kleene star regex, say a*? Above is the NFA for a*....

What is the difference between the following regular expressions? (a U b)* and (ab)* Difference between union and concatenation ? which of the above regex accepts strings in which 'a' is always b...

Would there be a difference between (aa)* and (a*a*)? Is there a distributive property?