Theory & Algorithms · Computer Science & AI
Formal Languages & Automata
The newest papers in Formal Languages & Automata that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
30 papers, from 5 September 2026 to 4 November 2026: 30 arXiv preprints.
Get the few papers worth your time in Formal Languages & Automata every morning.
Follow Formal Languages & Automata and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 2
Testing and Learning Symbolic Finite State Machines
Symbolic finite state machines (SFSMs) describe input/output behaviour using guards and output assignments with possibly infinite data domains.The Inverse Lyndon Array
The Lyndon array stores, at each position of a word, the length of the longest Lyndon factor starting at that position and plays an important role in combinatorics on words, for example, in the…Contributions to the hierarchy of probabilistic languages
We reconsider the theory of probabilistic formal languages generated by n-gram models and by probabilistic context-free grammars (PCFGs).Fast and Robust Temporal Logic Planning via ADMM-based Trajectory Optimization
We present a fast numerical method for safe continuous-time motion planning under Temporal Logic (TL) specifications.Stringological sequence prediction III: layered ziplines and a tradeoff between efficiency and expressivity
In previous papers, we began the study of sequence prediction algorithms adapted to stringological word complexity measures.Quiescence in Concert: Composing Multi-Channel Time-Outs for IOCO
In Model-Based Testing (MBT), test suites are generated automatically from a formal specification.A Non-constant Lower Bound for Grammar-Based Compression with Greedy
We prove a lower bound of Ω(log n/ log log n) on the approximation ratio of the global grammar-based compression algorithm Greedy.Characterizing Language Generation in the Limit: Finite Witnesses and a Separation-Width Hierarchy
Language generation in the limit asks for valid unseen elements from every exhaustive positive presentation of an unknown infinite language.Length Generalization for Transformers via Compression
Recent advancements in transformer length generalization theory enable us to reliably predict when a transformer can learn to solve a task.Programmable Cellular Automata
Cellular automata is a local computation paradigm where complex behavior can arise from local interactions between simple functions.