Deterministic top-down tree transducers with iterated look-ahead

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.143, Iss.2, 1995-06, pp. : 285-308

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

Shape preserving top-down tree transducers

By Fulop Z. Gazdag Z.

Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. : 315-339

Elsevier

Access to resources Recommend Favorite

Compositions with superlinear deterministic top-down tree transformations

By Danyi G. Fulop Z.

Theoretical Computer Science, Vol. 194, Iss. 1, 1998-03 ,pp. : 57-85

Elsevier

Access to resources Recommend Favorite

On the equivalence problem for letter-to-letter top-down tree transducers

By Andre Y. Bossut F.

Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. : 207-229

Elsevier

Access to resources Recommend Favorite

On look-ahead and pathology in decision tree learning

By Elomaa Tapio Malinen Tuomo

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 17, Iss. 1-2, 2005-01 ,pp. : 19-33

Taylor & Francis Ltd

Access to resources Recommend Favorite