In particular, I will focus on several algorithmic contributions we have made, including methods for (i) refining the structure of stochastic context free grammars, (ii) modeling and predicting ...

The AI revolution, which has begun to transform our lives over the past three years, is built on a fundamental linguistic ...

Successful steps of this classification include finite and virtually free groups, while the currently studied step is the one given by co-context-free groups. A conjecture of Lehnert characterizes ...

A web-based project that converts regular expressions into Deterministic Finite Automata (DFA), Context-Free Grammars (CFG), and Pushdown Automata (PDA) A web-based project that converts regular ...