Login / Signup

Implicit definability of finite binary trees by sets of equations.

Jerzy Tiuryn
Published in: Logic and Machines (1983)
Keyphrases
  • binary trees
  • finitely representable
  • series parallel
  • search algorithm
  • answer set programming