Login / Signup
An Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem for E-Pattern Languages.
Daniel Reidenbach
Published in:
J. Autom. Lang. Comb. (2007)
Keyphrases
</>
pattern languages
efficient learning
positive data
regular patterns
inductive inference
tree structured data
formal languages
design patterns
formal language theory
tree patterns
relational databases
hypothesis spaces
efficiently learnable