Login / Signup

Syntactically and Semantically Regular Languages of λ-Terms Coincide Through Logical Relations.

Vincent MoreauLê Thành Dung Nguyên
Published in: CSL (2024)
Keyphrases
  • regular languages
  • regular expressions
  • grammatical inference
  • context free languages
  • lower bound
  • sample size
  • finite automata
  • domain knowledge
  • learning tasks
  • context free
  • positive data