[2026-08-18 Tue (UTC), no new articles found for csFL Formal Languages and Automata Theory]

Maxence Ponsardin, Ville Salo: Thinking outside the box is useless NFA = FNFA https://arxiv.org/abs/2608.14111 https://arxiv.org/pdf/2608.14111 https://arxiv.org/html/2608.14111

[2026-08-17 Mon (UTC), 1 new article found for csFL Formal Languages and Automata Theory]

Yang, Veseli, Barloy, Cadilhac, Krebs, Paperman, Straubing, Hahn: Algebraic Decomposition Theory for Transformer Length Generalization https://arxiv.org/abs/2608.13433 https://arxiv.org/pdf/2608.13433 https://arxiv.org/html/2608.13433

[2026-08-14 Fri (UTC), 1 new article found for csFL Formal Languages and Automata Theory]

[2026-08-13 Thu (UTC), no new articles found for csFL Formal Languages and Automata Theory]

Marius Bozga, Radu Iosif, Florian Zuleger: Robust Algebraic Theories of Triangle Graphs https://arxiv.org/abs/2608.10927 https://arxiv.org/pdf/2608.10927 https://arxiv.org/html/2608.10927

Stefan G\"oller, Pawe{\l} Parys: Weak Bisimulation Finiteness of Pushdown Systems With Deterministic $\varepsilon$-Transitions Is 2-ExpTime-Complete https://arxiv.org/abs/2608.10583 https://arxiv.org/pdf/2608.10583 https://arxiv.org/html/2608.10583

[2026-08-12 Wed (UTC), 2 new articles found for csFL Formal Languages and Automata Theory]

Nicklas Nidh\"ogg: Certified Split Windows for Parallel Lexing: Recovering Boundaries Where No Byte Certifies https://arxiv.org/abs/2608.09761 https://arxiv.org/pdf/2608.09761 https://arxiv.org/html/2608.09761

[2026-08-11 Tue (UTC), 1 new article found for csFL Formal Languages and Automata Theory]

[2026-08-10 Mon (UTC), no new articles found for csFL Formal Languages and Automata Theory]

[2026-08-07 Fri (UTC), no new articles found for csFL Formal Languages and Automata Theory]

[2026-08-06 Thu (UTC), no new articles found for csFL Formal Languages and Automata Theory]

Nicklas Nidh\"ogg: Certified Split Points for Parallel Lexing: Exact and Modulo Discarded Tokens https://arxiv.org/abs/2608.03473 https://arxiv.org/pdf/2608.03473 https://arxiv.org/html/2608.03473

Akimasa Morihata: Translation of Regular Expression with Lookahead into Finite State Automaton https://arxiv.org/abs/2608.03167 https://arxiv.org/pdf/2608.03167 https://arxiv.org/html/2608.03167

[2026-08-05 Wed (UTC), 2 new articles found for csFL Formal Languages and Automata Theory]

[2026-08-04 Tue (UTC), no new articles found for csFL Formal Languages and Automata Theory]

[2026-08-03 Mon (UTC), no new articles found for csFL Formal Languages and Automata Theory]

Jason Bell, Laindon Burnett, Chris Schulz: Frequencies of subwords in words of linear subword complexity https://arxiv.org/abs/2607.28273 https://arxiv.org/pdf/2607.28273 https://arxiv.org/html/2607.28273

[2026-07-31 Fri (UTC), 1 new article found for csFL Formal Languages and Automata Theory]

Franz Nowak, Ryan Cotterell, Reda Boumasmoud: A Compositional Theory of Causally Masked Transformers https://arxiv.org/abs/2607.26988 https://arxiv.org/pdf/2607.26988 https://arxiv.org/html/2607.26988

Bj{\o}rn Kjos-Hanssen: Every string has probabilistic automatic complexity at most three https://arxiv.org/abs/2607.26275 https://arxiv.org/pdf/2607.26275 https://arxiv.org/html/2607.26275

[2026-07-30 Thu (UTC), 2 new articles found for csFL Formal Languages and Automata Theory]

Brian Curtin, Dmytro Savchuk: Combinatorial structures connecting Latin squares and bireversible automata https://arxiv.org/abs/2607.26013 https://arxiv.org/pdf/2607.26013 https://arxiv.org/html/2607.26013

Ran Ben Basat: Breaking the $4^k$ Barrier for the $k$-Distinct Language https://arxiv.org/abs/2607.25381 https://arxiv.org/pdf/2607.25381 https://arxiv.org/html/2607.25381

[2026-07-29 Wed (UTC), 2 new articles found for csFL Formal Languages and Automata Theory]

Takayuki Kuriyama: Additive Bases from Primitive Dyck Words: Regular Underapproximations, Motzkin Coding, and Digit Lifting https://arxiv.org/abs/2607.23521 https://arxiv.org/pdf/2607.23521 https://arxiv.org/html/2607.23521

Runzhou Li, Hongfei Fu, Qingkai Shi, Peisen Yao: Sharp Two-Round Adaptivity and Round Hierarchies for Semantic Regular Expressions https://arxiv.org/abs/2607.22799 https://arxiv.org/pdf/2607.22799 https://arxiv.org/html/2607.22799

[2026-07-28 Tue (UTC), 2 new articles found for csFL Formal Languages and Automata Theory]