Automata and Formal Languages Expert for Conversion and Automaton Construction

I’m looking to hire someone with expertise in formal languages and automata theory. The work involves constructing and converting various types of automata (NFAs, DFAs), working with regular expressions, and performing specific language conversion tasks based on detailed procedures. Experience with non-deterministic and deterministic automata is essential.

Key Responsibilities:

Convert non-deterministic finite automata (NFAs) to deterministic finite automata (DFAs) and regular grammars (RRGs)
Construct NFAs for various language operations, such as union, concatenation, and star operations
Convert regular expressions to NFAs
Handle tasks related to language operations and decision processes
Ensure accurate and timely completion of tasks