
Operator Precedence Tree Automata Matteo Pradella arxiv.org/abs/2611.22792 [𝚌𝚜.𝙵𝙻]

New Formal Languages and Automata Theory papers from arxiv.org: automata theory. Thank you to arXiv for use of its open access interoperability.

Operator Precedence Tree Automata Matteo Pradella arxiv.org/abs/2611.22792 [𝚌𝚜.𝙵𝙻]

Efficient Nominal Automata Computation with Strong Nominal Sets Hiroya Fujinami arxiv.org/abs/2611.22327 [𝚌𝚜.𝙵𝙻]

Boxes in Infinite Words: Complexity, Automata, and Point Modules Jason Bell arxiv.org/abs/2611.21772 [𝚌𝚜.𝙵𝙻 𝚖𝚊𝚝𝚑.𝙻𝙾 𝚖𝚊𝚝𝚑.𝚁𝙰]

Tensorized Automata: Algebraically Informed Representation Learning for Sequential Decision Making Anand Balakrishnan, Dweep Trivedi, Swarat Chaudhuri arxiv.org/abs/2611.21514 [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙻𝙶] 💬Submitted to L4DC 2027

Analysing Busy Beaver Machines (Or How to Find Ossified Ocelots) James Harland arxiv.org/abs/2611.17742 [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙻𝙾]

The Regular Cover Problem is NP-complete Stefan Hetzl, Parham Shadman arxiv.org/abs/2611.16562 [𝚌𝚜.𝙵𝙻]

The Left Ripple of Byte-Pair Encoding: Certified Lookbehind for Every Dictionary Nicklas Nidhögg arxiv.org/abs/2611.13061 [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙲𝙻 𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙿𝙻]

Two barriers for minimal time firing squads, with applications to four and five states Kia Keng Giam arxiv.org/abs/2611.11080 [𝚌𝚜.𝙵𝙻 𝚗𝚕𝚒𝚗.𝙲𝙶]

Towards A Parametrized Complexity of Determinization Ivan Baburin, Ryan Cotterell arxiv.org/abs/2611.10911 [𝚌𝚜.𝙵𝙻]

Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches Mikołaj Bojańczyk, Antonio Casares, Sven Manthe, Paweł Parys arxiv.org/abs/2611.10136 [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙻𝙾]

Word Subtraction Games Yusuke Inoue, Hiroki Inazu arxiv.org/abs/2611.09157 [𝚌𝚜.𝙵𝙻]

Shortest Synchronizing Words on Product Automata Henning Fernau, Igor Rystsov arxiv.org/abs/2611.09136 [𝚌𝚜.𝙵𝙻]

Reliability-Aware Z-Grammars and Z-Automata over a Credible-Grade Semiring Sherzod Turaev, Nor Haniza Sarmin, Wan Heng Fong arxiv.org/abs/2611.07781 [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙻𝙾]

Quadratic reset bounds for finite maximal prefix codes Samrath Singh Chadha arxiv.org/abs/2611.05675 [𝚌𝚜.𝙵𝙻]

Regular Separability for Bidirected VASS Łukasz Orlikowski, Georg Zetzsche arxiv.org/abs/2611.03313 [𝚌𝚜.𝙵𝙻]

The Scope Grammar of Natural-Language Rules: Counting and Enumerating Readings modulo Logical Equivalence Sherzod Turaev, Mary John arxiv.org/abs/2611.01825 [𝚌𝚜.𝙵𝙻 𝚌𝚜.𝙲𝙻 𝚌𝚜.𝙻𝙾]