EasyChair Smart SlideUser guide
Conference: Highlights26 (Highlights 2026)

This page shows all presentations from this conference published in EasyChair Smart Slide.

A Conway-Universal Automaton for Structurally Adam-Positional Automata

A Conway-Universal Automaton for Structurally Adam-Positional Automata

Thomas Colcombet and Olivier Idir

Asymptotic Hausdorff and Language Similarity

Asymptotic Hausdorff and Language Similarity

Dana Fisman and Gal Meirom

Exploring VASS Parameterised by Geometric Dimension

Exploring VASS Parameterised by Geometric Dimension

Wojciech Czerwiński

A Parameterized BüChi-Landweber Theorem

A Parameterized BüChi-Landweber Theorem

Paweł Parys

The Complexity of Well-Matched Regularity for Visibly Pushdown Languages

The Complexity of Well-Matched Regularity for Visibly Pushdown Languages

Annika Delb, Moses Ganardi and Marin Ricros

Type 2 Uncomputability, (Polynomial Functors) and Automata (!)

Type 2 Uncomputability, (Polynomial Functors) and Automata (!)

Cécilia Pradic

Multiplicity Equivalence of Context-Free Grammars

Multiplicity Equivalence of Context-Free Grammars

David Purser

PTIME algorithm for parity games

PTIME algorithm for parity games

Paweł Parys

First-Order Definability of Regular Tree Languages

First-Order Definability of Regular Tree Languages

Thomas Colcombet

Presentations in this collection: 9
Copyright © 2002 – 2026 EasyChair