Year: 2010
Type: preprint
Abstract: We show that left-linear generalized semi-monadic TRSs effectively preserving recognizability of finite tree languages (are EPRF-TRSs). We show that reachability, joinability, and local confluence are decidable for EPRF-TRSs.
Source: arXiv (Cornell University)
Author: vagvolgyi, Sandor
Institution: University of Szeged
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2950908425