- Summary
- Here's a summary of the website content:
The website details research related to polynomial growth in tree automata, MSO set queries, and -calculi. Key activities include Baptiste Chanus’s PhD defense presentation on category-theoretic descriptive complexity, a workshop honoring Stefano Guerrini’s 60th birthday focusing on non-linear higher-order tree transducers, and a LambdaComb Days talk on the complexity of normalization in planar -terms. Recent work explores the TOWER-completeness of convertibility for -calculi (particularly safe -terms), demonstrating P-completeness for planar -terms and a joint effort with Das, Mazza, and Zeilberger. Slides from these presentations and discussions about the future of the GT Scalp conference are also available. - Title
- Tito's presence on the web
- Description
- Lê Thành Dũng (Tito) Nguyễn's professional webpage: research in theoretical computer science
- Keywords
- logic, automata, proof, have, slides, computer, work, science, complexity, transducers, research, theory, terms, regular, more, languages, paper
- NS Lookup
- A 78.192.88.164, A 45.81.62.36, A 82.65.41.110
- Dates
-
Created 2026-03-07Updated 2026-03-07Summarized 2026-03-08
Query time: 1444 ms