Grammatic al Inference (GI) studies machine learning algorit hms for classical recursive models of computations like automata and grammars. The expressive power of these models and the complexity of associated c omputational problems are a major research topic w ithin theoretical computer science (TCS). This wor kshop aims at offering a favorable place for dialo gue and at generating discussions between research ers from these two communities.
\n\nThe wo rkshop will have a particular emphasis on the rece nt successes due to collaborations between members with these two different backgrounds.
\nWe invite submissions of recent works, possibly preliminary ones, related to the theme o f the workshop. Similarly to how main machine lear ning conferences and workshops are organized, all accepted abstracts will be part of a poster sessio n held during the workshop. Additionally, the Prog ram Committee will select a subset of the abstract s for oral presentation. At least one author of ea ch accepted abstract is expected to represent it a t the workshop.
\n