cs.FL · 2026-08-11 · No. 81

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

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 Windows for Parallel Lexing: Recovering Boundaries Where No Byte Certifies

    Nicklas Nidhögg

    cs.FL · cs.DC · cs.PL

    A certified split point lets a parallel lexer cut unlexed input at a single byte with the serial token stream provably preserved, but several conventional token sets in the predecessor's controlled study certify no byte once string, comment, or whitespace-run forms are included (arXiv:2608.03473). We generalize from a byte to a bounded window: a byte string after which the position where the current token began is known, regardless of...

    arxiv.org/abs/2608.09761 · 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.