Login / Signup

The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable.

Yves AndreFrancis Bossut
Published in: TAPSOFT (1995)
Keyphrases
  • cursive handwriting
  • special case
  • np hard
  • tree structure
  • similarity measure
  • data driven
  • real time
  • real world
  • machine learning
  • artificial intelligence
  • website
  • database systems
  • search algorithm
  • np complete
  • binary tree