11740 search results - page 1 / 2348 » More Problems in Rewriting |
RTA
1993
Springer
13 years 9 months ago
1993
Springer
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist in introducing...
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...