Solving of Regular Equations Revisited
Solving of regular equations via Arden’s Lemma is folklore knowledge. We first give a concise algorithmic specification of all elementary solving steps. We then discuss a computational interpretation of solving in terms of coercions that transform parse trees of regular equations into parse trees of solutions. Thus, we can identify some conditions on the shape of regular equations under which resulting solutions are unambiguous. We apply our result to convert a DFA to an unambiguous regular expression. In addition, we show that operations such as subtraction and shuffling can be expressed via some appropriate set of regular equations. Thus, we obtain direct (algebraic) methods without having to convert to and from finite automaton.
KeywordsRegular equations and expressions Parse trees Ambiguity Subtraction Shuffling
We thank referees for CIAA’18, ICTAC’18 and ICTAC’19 for their helpful comments on previous versions of this paper.
- 2.Arden, D.N.: Delayed-logic and finite-state machines. In: 2nd Annual Symposium on Switching Circuit Theory and Logical Design, Detroit, Michigan, USA, 17–20 October 1961, pp. 133–151 (1961)Google Scholar
- 3.Brabrand, C., Thomsen, J.G.: Typed and unambiguous pattern matching on strings using regular expressions. In: Proceedings of PPDP 2010, pp. 243–254. ACM (2010)Google Scholar
- 12.Lu, K.Z.M., Sulzmann, M.: Solving regular expression equations. http://github.com/luzhuomi/regex-symb
- 14.Neumann, C.: Converting deterministic finite automata to regular expressions, March 2005. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.2597
- 17.Sakarovitch, J.: Automata and rational expressions (2015). https://arxiv.org/abs/1502.03573