New answers tagged regular-expressions
11
Yes, every regular expression can be converted into an unambiguous one by converting to a DFA and then to a regular expression. And no, there aren't any inherently ambiguous regular languages in the sense described in the question. This is a classic result in automata theory:
R. Book, S. Even, S. Greibach and G. Ott, Ambiguity in graphs and expressions, ...
Top 50 recent answers are included
