Linear Systems for Regular Hedge Languages

摘要

We propose linear systems of hedge language equations as a formalism to represent regular hedge languages. This formalism is suitable for several algebraic computations, such as intersections, quotients, left and right factors of regular hedge languages. We indicate algorithms for the translation between hedge automata and linear systems of hedge language equations, and for the computations mentioned before.