A formal framework based on bijective parse-tree coercions shows that non-overlapping regular equations, including those from DFAs and subtraction, yield unambiguous solutions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Solving of Regular Equations Revisited (extended version)
A formal framework based on bijective parse-tree coercions shows that non-overlapping regular equations, including those from DFAs and subtraction, yield unambiguous solutions.