Extended to Multi-Tilde-Bar Regular Expressions and Efficient Finite Automata Constructions

Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi

Several algorithms have been designed to convert a regular expression into an equivalent finite automaton. One of the most popular constructions, due to Glushkov and to McNaughton…