Login / Signup

Note on a Proof of the Extended Kirby - Paris Theorem on Labeled Finite Trees.

Mitsuhiro Okada
Published in: Eur. J. Comb. (1988)
Keyphrases
  • interactive theorem proving
  • decision trees
  • ordered trees
  • training data
  • unordered trees
  • real time
  • theorem prover
  • training set
  • supervised learning
  • tree structure
  • finite automata