Login / Signup

An upper bound on the complexity of recognizable tree languages.

Olivier FinkelDominique LecomtePierre Simonnet
Published in: RAIRO Theor. Informatics Appl. (2015)
Keyphrases
  • upper bound
  • worst case
  • tree languages
  • lower bound
  • tree automata
  • learning algorithm
  • positive and negative