Danièle Beauquier, Damian Niwinski. Automata on Infinite Trees with Counting Constraints. In Marie-Claude Gaudel, Jean-Pierre Jouannaud, editors, TAPSOFT 93: Theory and Practice of Software Development, International Joint Conference CAAP/FASE, Orsay, France, April 13-17, 1993, Proceedings. Volume 668 of Lecture Notes in Computer Science, pages 266-281, Springer, 1993.
@inproceedings{BeauquirerN93, title = {Automata on Infinite Trees with Counting Constraints}, author = {Danièle Beauquier and Damian Niwinski}, year = {1993}, tags = {constraints}, researchr = {https://researchr.org/publication/BeauquirerN93}, cites = {0}, citedby = {0}, pages = {266-281}, booktitle = {TAPSOFT 93: Theory and Practice of Software Development, International Joint Conference CAAP/FASE, Orsay, France, April 13-17, 1993, Proceedings}, editor = {Marie-Claude Gaudel and Jean-Pierre Jouannaud}, volume = {668}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-56610-4}, }