Converting Regular Expression to NFA
What is a regular expression?
Which symbol represents the union operation in regular expressions?
What does the * operator in regular expressions mean?
What is an NFA?
What is Thompson's construction?
What is an epsilon transition in an NFA?
What is the time complexity of Thompson's construction?
What is the relationship between regular expressions and NFAs?
What is the main advantage of using NFAs over DFAs?