@inproceedings{DBLP:conf/fsttcs/Saoudi90,
author = {Abdellatif Saoudi},
title = {Recognizable Infinite Tree Sets and their Complexity},
booktitle = {FSTTCS},
year = {1990},
pages = {91-103},
ee = {http://dx.doi.org/10.1007/3-540-53487-3_37},
crossref = {DBLP:conf/fsttcs/1990},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/fsttcs/1990,
editor = {Kesav V. Nori and
C. E. Veni Madhavan},
title = {Foundations of Software Technology and Theoretical Computer
Science, Tenth Conference, Bangalore, India, December 17-19,
1990, Proceedings},
booktitle = {FSTTCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {472},
year = {1990},
isbn = {3-540-53487-3},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Last update 2009-06-10 CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
