![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/fsttcs/Saoudi90
@inproceedings{DBLP:conf/fsttcs/Saoudi90, author = {Abdellatif Saoudi}, editor = {Kesav V. Nori and C. E. Veni Madhavan}, title = {Recognizable Infinite Tree Sets and their Complexity}, booktitle = {Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {472}, pages = {91--103}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/3-540-53487-3\_37}, doi = {10.1007/3-540-53487-3\_37}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/Saoudi90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.