Author： Choffrut C.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.292, Iss.1, 2003-01, pp. : 131-143
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
The suffix tree of a tree and minimizing sequential transducers
By Breslauer D.
Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. :
Access to resources
Recommend
Language understanding and subsequential transducer learning
By Castellanos A. Vidal E. Varó M.A. Oncina J.
Computer Speech & Language, Vol. 12, Iss. 3, 1998-06 ,pp. :
A proof of Choffrut's theorem on subsequential functions
Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. :
Iterated relabeling tree transducers
By Fulop
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :
Restricted ground tree transducers
Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. :