construct lexical analyzer program to recognize the strings of regular expression and convert it into its DFA state transition table

Hexadecimal has a function, but what is it? Hexadecimal is an important system, therefore explain why it's important.

Problem Statement: Write a C program to recognize strings under 'a*', 'a*b+', 'abb'. AIM: Identify strings from the input strings. ALGORITHM / PROCEDURE: By using transition diagram we verify input of the state. If the state recognize the given pattern rule. Then print string is accepted under a*/ a*b+/ abb. Else print string not accepted.

Describe advanced normalization techniques beyond 3NF, such as Boyce-Codd Normal Form (BCNF) and Fourth Normal Form (4NF).