PROGRAM
Days: Tuesday, September 3rd Wednesday, September 4th Thursday, September 5th Friday, September 6th
Tuesday, September 3rd
View this program: with abstractssession overviewtalk overview
09:00-09:30 Session 1
Opening
09:30-10:30 Session 2
Contributed talks
| 09:30 | On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters (abstract) |
| 10:00 | On bidirectional deterministic finite automata (abstract) |
13:30-15:00 Session 4
Contributed talks
| 13:30 | Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (abstract) |
| 14:00 | Attributed Tree Transducers for Partial Functions (abstract) |
| 14:30 | Global One-Counter Tree Automata (abstract) |
15:30-17:00 Session 5
Contributed talks
| 15:30 | Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals (abstract) |
| 16:00 | Constructing a BPE Tokenization DFA (abstract) |
| 16:30 | The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable (abstract) |
Wednesday, September 4th
View this program: with abstractssession overviewtalk overview
09:00-10:30 Session 6
Contributed talks
| 09:00 | Computing the Bandwidth of Meager Timed Automata (abstract) |
| 09:30 | SAT-Based Automated Completion for Reachability Analysis (abstract) |
| 10:00 | Non-Emptiness Test for Automata over Words Indexed by Reals and Rationals (abstract) |
13:30-15:00 Session 8
Contributed talks
| 13:30 | Push Complexity: Optimal Bounds and Unary Inputs (abstract) |
| 14:00 | On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers (abstract) |
| 14:30 | On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract) (abstract) |
15:30-17:00 Session 9
Contributed talks
| 15:30 | Block Languages and their Bitmap Representations (abstract) |
| 16:00 | State Complexity of the Minimal Star Basis (abstract) |
| 16:30 | Exact descriptional complexity of determinization of input-driven pushdown automata (abstract) |
Thursday, September 5th
View this program: with abstractssession overviewtalk overview
09:00-10:30 Session 10
Contributed talks
| 09:00 | Benchmarking Regular Expression Matching (abstract) |
| 09:30 | Translation of Semi-Extended Regular Expressions using Derivatives (abstract) |
| 10:00 | PDFA distillation with error bound guarantees (abstract) |
11:00-12:00 Session 11
Invited talk
| 11:00 | Neuro-Symbolic Approach for Efficient Regular Expression Inference (abstract) |
12:00-17:30
Excursion to Kakunodate by bus (lunch, visit to a sake brewery and sightseeing)
18:30-21:00
Conference dinner
Friday, September 6th
View this program: with abstractssession overviewtalk overview
09:30-10:30 Session 12
Contributed talks
| 09:30 | Decision Problems for Subregular Classes (abstract) |
| 10:00 | Decision problems for reversible and permutation automata (abstract) |
13:30-14:30 Session 14
Contributed talks
| 13:30 | From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups (abstract) |
| 14:00 | Measuring Power of Commutative Group Languages (abstract) |
14:30-15:00 Session 15
Closing remarks