Automata Theory Expert Needed for NFA to DFA, Regex to NFA, and DFA to GrMr expert needed

Description: I am seeking a freelancer with expertise in automata theory and finite state machines. The task involves converting several automata structures as follows:

NFA to DFA: Convert nondeterministic finite automata (NFA) into deterministic finite automata (DFA).
Regex to NFA: Construct an NFA from a given regular expression.
DFA to Right Regular Grammar (RRG): Translate a DFA into a right regular grammar.
NFA Union, Concatenation, and Star Operations: Implement standard NFA operations such as union, concatenation, and star closures.
DFA Majority: Combine multiple DFAs to recognize the majority of their languages.
The final deliverables should be in the required formats, adhering to specified naming conventions. Experience in working with automata simulators or relevant tools is a plus. Please provide examples of similar work or explain your approach to these conversions when applying.

Skills Required:

Experience in Automata Theory
Proficiency in Algorithms and Mathematics
Familiarity with Finite State Machines
Knowledge of Python or another programming language for implementing conversions
Strong understanding of Formal Languages