%0 Conference Paper %1 conf/mfcs/Niwinski91 %A Niwinski, Damian %B MFCS %D 1991 %E Tarlecki, Andrzej %I Springer %K dblp %P 367-376 %T On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata. %U http://dblp.uni-trier.de/db/conf/mfcs/mfcs91.html#Niwinski91 %V 520 %@ 3-540-54345-7

@inproceedings{conf/mfcs/Niwinski91, added-at = {2017-03-20T00:00:00.000+0100}, author = {Niwinski, Damian}, biburl = {https://www.bibsonomy.org/bibtex/2ec51301520d3a56e3749327e423d030c/dblp}, booktitle = {MFCS}, crossref = {conf/mfcs/1991}, editor = {Tarlecki, Andrzej}, ee = {http://dx.doi.org/10.1007/3-540-54345-7_80}, interhash = {755e9bccabd37f98e64024ac591a04b1}, intrahash = {ec51301520d3a56e3749327e423d030c}, isbn = {3-540-54345-7}, keywords = {dblp}, pages = {367-376}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2017-03-21T11:39:35.000+0100}, title = {On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata.}, url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs91.html#Niwinski91}, volume = 520, year = 1991 }