E-unification by means of tree tuple synchronized grammars.
Limet, Sébastien; Réty, Pierre
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (1997)
- Volume: 1, Issue: 1, page 69-98
- ISSN: 1365-8050
Access Full Article
top
How to cite
topLimet, Sébastien, and Réty, Pierre. "E-unification by means of tree tuple synchronized grammars.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 1.1 (1997): 69-98. <http://eudml.org/doc/120201>.
@article{Limet1997,
author = {Limet, Sébastien, Réty, Pierre},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {narrowing; tree language; decidability; E-unification; unifiability; equational theory; rewrite system},
language = {eng},
number = {1},
pages = {69-98},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {E-unification by means of tree tuple synchronized grammars.},
url = {http://eudml.org/doc/120201},
volume = {1},
year = {1997},
}
TY - JOUR
AU - Limet, Sébastien
AU - Réty, Pierre
TI - E-unification by means of tree tuple synchronized grammars.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 1997
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 1
IS - 1
SP - 69
EP - 98
LA - eng
KW - narrowing; tree language; decidability; E-unification; unifiability; equational theory; rewrite system
UR - http://eudml.org/doc/120201
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.