4 papers
Union of Finitely Generated Congruences on Ground Term Algebra
Sándor Vágvölgyi
We show that for any ground term equation systems and , (1) the union of the generated congruences by and is a congruence on the ground term algebra if and only if t…
Threefold Post Correspondence System
Sandor Vagvolgyi
We introduce the concept of a threefold Post correspondence system (3PCS for short) and we consider it as an instance of the threefold Post correspondence problem. With each 3PCS,…
Rewriting Preserving Recognizability of Finite Tree Languages
Sandor vagvolgyi
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…
On ground word problem of term equation systems
Sandor Vagvolgyi
We give semi-decision procedures for the ground word problem of variable preserving term equation systems and term equation systems. They are natural improvements of two well known…