Enumerative sequences of leaves and nodes in rational trees

Author： Bassino F.   Beal M.-P.   Perrin D.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.221, Iss.1, 1999-06, pp. : 41-60

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Improving spanning trees by upgrading nodes

By Krumke S.O.   Noltemeier H.   Wirth H.-C.   Marathe M.V.   Ravi R.   Ravi S.S.   Sundaram R.  

Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. : 139-155

Elsevier

Access to resources Recommend Favorite

Pair-sharing over rational trees

By King A.  

The Journal of Logic Programming, Vol. 46, Iss. 1, 2000-11 ,pp. : 139-155

Elsevier

Access to resources Recommend Favorite

Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees

By Mahmoud Hosam   Tsukiji Tatsuie  

Acta Informatica, Vol. 41, Iss. 2-3, 2004-12 ,pp. : 99-110

Springer Publishing Company

Access to resources Recommend Favorite

Use of Images of Leaves and Fruits of Apple Trees for Automatic Identification of Symptoms of Diseases and Nutritional Disorders

By  

International Journal of Monitoring and Surveillance Technologies Research (IJMSTR), Vol. 5, Iss. 2, 2017-04 ,pp. : 1-14

IGI Global_journal

Access to resources Recommend Favorite

On rational series and rational languages

By Huaxiong W.  

Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. : 329-336

Elsevier

Access to resources Recommend Favorite