@article{DJELLOUL_2008,
    doi = {10.1017/s1471068407003171},
    url = {https://doi.org/10.1017%2Fs1471068407003171},
    year = {2008},
    month = {may},
    publisher = {Cambridge University Press ({CUP})},
    volume = {8},
    number = {04},
    pages = {431--489},
    author = {KHALIL DJELLOUL and THI-BICH-HANH DAO and THOM FRÜHWIRTH},
    title = {Theory of finite or infinite trees revisited},
    journal = {Theory and Practice of Logic Programming}
}

@article{DJELLOUL_2008, doi = {10.1017/s1471068407003171}, url = {https://doi.org/10.1017%2Fs1471068407003171}, year = {2008}, month = {may}, publisher = {Cambridge University Press ({CUP})}, volume = {8}, number = {04}, pages = {431--489}, author = {KHALIL DJELLOUL and THI-BICH-HANH DAO and THOM FRÜHWIRTH}, title = {Theory of finite or infinite trees revisited}, journal = {Theory and Practice of Logic Programming} }