Login / Signup

A Graph-Based Regularity Test for Deterministic Context-free Languages.

Priti ShankarB. S. Adiga
Published in: Theor. Comput. Sci. (1991)
Keyphrases
  • context free languages
  • grammatical inference
  • context free grammars
  • semi supervised
  • context free
  • knowledge base
  • lower bound
  • active learning
  • pattern matching