Showing cs.LOShow all
2 papers · 1 filter
cs.LO2010
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…
cs.LO2009
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…