Welcome
Important: The deadline has been extended by one week: April 25th AoE.
The fifth edition of "Learning and Automata" (LearnAut) will be held at ICALP/LiCS/FSCD 2024 in Tallinn (Estonia), 7th of July 2024.
Scope
Grammatical Inference (GI) studies machine learning algorithms for various language related models such as automata and grammars. Historically, these models are used, for instance, to understand natural language and to do computational linguistics. At the same time, these kind of models are also a major research topic within the ICALP community. These models are central in understanding recursive computations and their expressive power and complexity. In recent years we have seen some important results starting to bridge the gap between both worlds, including applications of learning to formal verification and model checking, (co-)algebraic formulations of automata and grammar learning algorithms and theoretical foundations of learning. The aim of this workshop is to bring together experts on language theory that could benefit from grammatical inference tools, and researchers in grammatical inference who could find new insights for their methods in theoretical computer science.
The aim of this workshop is to bring together experts on language theory that could benefit from grammatical inference tools, and researchers in grammatical inference who could find new insights for their methods in theoretical computer science.
Content
The LearnAut workshop will consists of a number of invited talks, other talks from researchers who submitted their work to the workshop, and discussions. An important amount of time will be kept for interactions between participants.
Previous editions
- LearnAut 2022 in Paris, July 4 2022, colocated with ICALP
- LearnAut 2019 in Vancouver, June 23 2019, colocated with LICS
- LearnAut 2018 in Oxford, July 13 2018, colocated with FLOC
- LearnAut 2017 in Reykjavik, June 19 2017, colocated with LICS
Acknowledgment
This workshop is partially supported by the EPSRC project CLeVer (EP/S028641/1)