cs.FL · 2026-08-05 · No. 75

Formal Languages and Automata Theory, 2026-08-05.

1 new papers in cs.FL. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

1 entries
  1. 01

    Certified Split Points for Parallel Lexing: Exact and Modulo Discarded Tokens

    Nicklas Nidhögg

    cs.FL · cs.DC · cs.PL

    Table-driven DFA lexing is sequential: each transition depends on the previous byte's state. Scanning one input in parallel needs each chunk's entry state, which existing methods recover by simulation, speculation, prescanning, or overlap. We give two conditions under which none is needed. For a longest-match scanner restarting from q0 at every token boundary, a byte b is a certified split symbol when no reachable state other than q0 has a...

    arxiv.org/abs/2608.03473 · PDF

This edition is part of The Daily Abstract — cs.FL archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.