Kalina on the Subregular Complexity of Persistent Features
Today Kalina will be talking about how persistent features might affect the complexity of the basic operations in MG syntax. Hope to see you all there!
Today Kalina will be talking about how persistent features might affect the complexity of the basic operations in MG syntax. Hope to see you all there!
Tomorrow Dakotah and Jon will be talking about their ongoing work involving generalized finite state automata. They'll be discussing a class of string-to-string transducers that corresponds to a certain idea of locality in origin-graph semantics. As this is a work in progress, they'd appreciate any feedback you might have!
Based on the discussion in our first meeting, we have decided on a slightly unusual schedule. We will meet every other Friday from 2:30 to 3:30. This minimizes scheduling conflicts for our regular attendants. Please check the schedule for an overview of the upcoming meetings.
Our first regular …
Scheduling this year's MLRG has turned out to be a lot trickier than usual. The time that seems to work for most people is
We will have our first organizational meeting tomorrow at this time. Based on who shows up, and pending further discussion, the time …
Welcome back everyone!
With the start of a new semester, we have to once again agree on a meeting time. As usual, we will meet for one hour each Friday at some time around noon. Please indicate your availability using the when2meet poll.
You do not need to create an …