Program for Tuesday, September 3rd: Talk View

PROGRAM FOR TUESDAY, SEPTEMBER 3RD: TALK VIEW

Days:

next day

all days

View: with abstracts session overview

9:00

9:30

10:00

10:30

11:00

11:30

12:00

12:30

13:00

13:30

14:00

14:30

15:00

15:30

16:00

16:30

17:00

09:00-09:30 Session 1

09:30-10:00

On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input

M. Kutrib, A. Malcher, C. Mereghetti, B. Palano, P. Raucci, M. Wendlandt

10:00-10:30

On bidirectional deterministic finite automata

Simon Dieck, Sicco Verwer

11:00-12:00

Automata and Grammars for Data Words

Hiroyuki Seki

13:30-14:00

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata

Keisuke Nakano, Munehiro Iwami

14:00-14:30

Attributed Tree Transducers for Partial Functions

Sebastian Maneth, Viet Anh Martin Vu

14:30-15:00

Global One-Counter Tree Automata

Luisa Herrmann, Richard Mörbitz

15:30-16:00

Using finite automata to compute the base-b representation of the golden ratio and other quadratic

Aaron Barnoff, Curtis Bright, Jeffrey Shallit

16:00-16:30

Constructing a BPE Tokenization DFA

Martin Berglund, Willeke Martens, Brink van der Merwe

16:30-17:00

The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable

Dirk Nowotka, Max Wiedenhöft