Closure of Tree Automata Languages under Innermost Rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Closure of Tree Automata Languages under Innermost Rewriting


Preservation of regularity by a term rewriting system (TRS) states that the set of reachable terms from a tree automata (TA) language (aka regular term set) is also a TA language. It is an important and useful property, and there have been many works on identifying classes of TRS ensuring it; unfortunately, regularity is not preserved for restricted classes of TRS like shallow TRS. Nevertheless, this property has not been studied for important strategies of rewriting like the innermost strategy -- which corresponds to the {\em call by value} computation of programming languages. We prove that the set of innermost-reachable terms from a TA language by a shallow TRS is not necessarily regular, but it can be recognized by a TA with equality and disequality constraints between brothers. As a consequence we conclude decidability of regularity of the reachable set of terms from a TA language by innermost rewriting and shallow TRS. This result is in contrast with plain (not necessarily innermost) rewriting for which we prove undecidability. We also show that, like for plain rewriting, innermost rewriting with linear and right-shallow TRS preserves regularity.
Fichier principal
Vignette du fichier
btregularity-wrs-HAL.pdf (265.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00578966 , version 1 (22-03-2011)



Adria Gascon, Guillem Godoy, Florent Jacquemard. Closure of Tree Automata Languages under Innermost Rewriting. 8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS), Jul 2008, Hagenberg, Austria. pp.23-38, ⟨10.1016/j.entcs.2009.03.033⟩. ⟨inria-00578966⟩
124 View
113 Download



Gmail Facebook Twitter LinkedIn More