Layered Transducing Term Rewriting System and Its Recognizability Preserving Property

A term rewriting system which effectively preserves recognizability (EPR-TRS) has good mathematical properties. In this paper, a new subclass of TRSs, layered transducing TRSs (LT-TRSs) is defined and its recognizability preserving property is discussed. The class of LT-TRSs contains some EPR-TRSs, e.g., {f(x) ? f(g(x))} which do not belong to any of the known decidable subclasses of EPR-TRSs. Bottom-up linear tree transducer, which is a well-known computation model in the tree language theory, is a special case of LT-TRS. We present a sufficient condition for an LT-TRS to be an EPR-TRS. Also some properties of LT-TRSs including reachability are shown to be decidable.

[1]  Rémi Gilleron.  Decision Problems for Term Rewriting Systems and Recognizable Tree Languages , 1991, STACS.

[2]  Ferenc Gécseg,et al.  Tree Automata , 2015, ArXiv.

[3]  Sophie Tison,et al.  Regular Tree Languages and Rewrite Systems , 1995, Fundam. Informaticae.

[4]  Takashi Nagaya,et al.  Decidability for Left-Linear Growing Term Rewriting Systems , 1998, Inf. Comput..

[5]  Sándor Vágvölgyi,et al.  Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability , 1998, Theor. Comput. Sci..

[6]  Thomas Genet,et al.  Decidable Approximations of Sets of Descendants and Sets of Normal Forms , 1998, RTA.

[7]  Aart Middeldorp,et al.  Approximating Dependency Graphs Using Tree Automata Techniques , 2001, IJCAR.

[8]  Kai Salomaa,et al.  Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems , 1988, J. Comput. Syst. Sci..

[9]  Aart Middeldorp,et al.  Decidable Call by Need Computations in term Rewriting (Extended Abstract) , 1997, CADE.

[10]  Walter S. Brainerd,et al.  Tree Generating Regular Systems , 1969, Inf. Control..

[11]  P. Gregory,et al.  February , 1890, The Hospital.

[12]  Yoshihito Toyama,et al.  Decidability for Left-Linaer Growing Term Rewriting Systems , 1999, RTA.

[13]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[14]  Florent Jacquemard,et al.  Decidable Approximations of Term Rewriting Systems , 1996, RTA.

[15]  Sándor Vágvölgyi,et al.  Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems , 1994, Theor. Comput. Sci..

[16]  Hiroyuki Seki,et al.  Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability , 2000, RTA.

[17]  Pierre Réty.  Regular Sets of Descendants for Constructor-Based Rewrite Systems , 1999, LPAR.