The state elimination algorithm is an algorithm for converting finite automata into regular expressions. It's found in many textbooks, including Sipser's Introduction to the Theory of Computation. However, I can't seem to find any references to who first invented this algorithm.
Does anyone know who invented the state elimination algorithm? Ideally, I'd like a reference to a specific paper or textbook.