formal-language-and-automata Check the finite deterministic automata accept a string and convert nondeterministic automata to deterministic automata