The problem of learning a computational model from examples has been
rec...
We define the problem of learning a transducer S from a target language
...
The problem of identifying a probabilistic context free grammar has two
...
We study the learnability of symbolic finite state automata, a model sho...
We address the problem of learning human-interpretable descriptions of a...
Syntax-guided synthesis (SyGuS) is the computational problem of finding ...
A regular language is almost fully characterized by its right congruence...
Motivated by real-time monitoring and data processing applications, we
d...
We present the first polynomial time algorithm to learn nontrivial class...
Syntax-Guided Synthesis (SyGuS) is the computational problem of finding ...
The SYNT workshop aims to bring together researchers interested in the b...