Extended multi bottom-up tree transducers: Composition and decomposition

ISSN： 0001-5903

Source： Acta Informatica, Vol.46, Iss.8, 2009-12, pp. : 561-590

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

Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations

By Gyenizse P. Vagvolgyi S.

Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. : 71-97

Elsevier

Access to resources Recommend Favorite

Bottom-Up Induction of Feature Terms

By Armengol E.

Machine Learning, Vol. 41, Iss. 3, 2000-12 ,pp. : 259-294

Springer Publishing Company

Access to resources Recommend Favorite

A bottom-up algorithm of vertical assembling concept lattices

By Zhang Lei

International Journal of Data Mining and Bioinformatics, Vol. 7, Iss. 3, 2013-04 ,pp. : 229-244

Inderscience Publishers

Access to resources Recommend Favorite

Iterated relabeling tree transducers

By Fulop

Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. : 221-244

Elsevier

Access to resources Recommend Favorite

Restricted ground tree transducers

By Fulop Z. Vagvolgyi S.

Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. : 219-233

Elsevier

Access to resources Recommend Favorite