Tootfinder

Symbolic Feedforward Networks for Probabilistic Finite Automata: Exact Simulation and Learnability
Sahil Rajesh Dhayalkar
https://arxiv.org/abs/2509.10034 https://

Symbolic Feedforward Networks for Probabilistic Finite Automata: Exact Simulation and Learnability
We present a formal and constructive theory showing that probabilistic finite automata (PFAs) can be exactly simulated using symbolic feedforward neural networks. Our architecture represents state distributions as vectors and transitions as stochastic matrices, enabling probabilistic state propagation via matrix-vector products. This yields a parallel, interpretable, and differentiable simulation of PFA dynamics using soft updates-without recurrence. We formally characterize probabilistic subse…

Variational Quantum Eigensolver Models of Molecular Quantum Dot Cellular Automata
Nischal Binod Gautam, Enrique P. Blair
https://arxiv.org/abs/2510.12656 https://

Variational Quantum Eigensolver Models of Molecular Quantum Dot Cellular Automata
Molecular quantum-dot Cellular Automata (QCA) may provide low-power, high-speed computational hardware for processing classical information. Simulation and modeling play an important role in the design of QCA circuits because fully-coherent models of QCA scale exponentially with the number of devices, and such models are severely limited in size. For larger circuits, approximations become necessary. In the era of fault-tolerant quantum computation, however, it may become possible to model large…

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Mathematical Approach in Automata and Automata Association
Sergio Henrique Maciel
h…

Supervised and unsupervised learning with numerical computation for the Wolfram cellular automata
Kui Tuo, Shengfeng Deng, Yuxiang Yang, Yanyang Wang, Qiuping A. Wang, Wei Li, Wenjun Zhang
https://arxiv.org/abs/2509.10209

Supervised and unsupervised learning with numerical computation for the Wolfram cellular automata
The local rules of Wolfram cellular automata with one-dimensional three-cell neighborhoods are represented by eight-bit binary that encode deterministic update rules. These automata are widely utilized to investigate self-organization phenomena and the dynamics of complex systems. In this work, we employ numerical simulations and computational methods to investigate the asymptotic density and dynamical evolution mechanisms in Wolfram automata. We apply both supervised and unsupervised learning …

Formally Verified Certification of Unsolvability of Temporal Planning Problems
David Wang, Mohammad Abdulaziz
https://arxiv.org/abs/2510.10189 https://arxi…

Formally Verified Certification of Unsolvability of Temporal Planning Problems
We present an approach to unsolvability certification of temporal planning. Our approach is based on encoding the planning problem into a network of timed automata, and then using an efficient model checker on the network followed by a certificate checker to certify the output of the model checker. Our approach prioritises trustworthiness of the certification: we formally verify our implementation of the encoding to timed automata using the theorem prover Isabelle/HOL and we use an existing cer…

Leveraging Cellular Automata for Real-Time Wildfire Spread Modeling in California
Connor Weinhouse, Jameson Augustin
https://arxiv.org/abs/2510.09708 https://

Leveraging Cellular Automata for Real-Time Wildfire Spread Modeling in California
Wildfires are becoming increasingly frequent and devastating, and therefore the technology to combat them must adapt accordingly. Modern predictive models have failed to balance predictive accuracy and operational viability, resulting in consistently delayed or misinformed fire suppression and public safety efforts. The present study addresses this gap by developing and validating a predictive model based on cellular automata (CA) that incorporates key environmental variables, including vegetat…

MonochromeEvolutionaryBioDigitalMultiCellularSymbiosisStruggle
(Selected stills from my infinitely evolving C-SCAPE project, 2022 - made with #MonochromeMonday

The Tribonacci constant and finite automata
Jeffrey Shallit
https://arxiv.org/abs/2510.10834 https://arxiv.org/pdf/2510.10834

The Tribonacci constant and finite automata
We show that there is no automaton accepting the Tribonacci representations of $n$ and $x$ in parallel, where $ψ= 1.839\cdots$ is the Tribonacci constant, and $x= \lfloor n ψ\rfloor$. Similarly, there is no Tribonacci automaton generating the Sturmian characteristic word with slope $ψ-1$.

Certifying Quantum Gates via Automata Advantage
Anna Schroeder, Lucas B. Vieira, Jan N\"oller, Nikolai Miklin, Mariami Gachechiladze
https://arxiv.org/abs/2510.09575 https:…

Certifying Quantum Gates via Automata Advantage
There is growing interest in developing rigorous tests of quantumness that are feasible even before practical quantum advantages become a reality. Such tests not only aim to certify the quantum nature of a system but also serve as benchmarks for precise quantum control. In this work, we argue that promise problems, studied in the theory of finite automata, provide a natural framework for designing sound tests of quantum gate quality. Soundness, the property that only implementations of sufficie…

Replaced article(s) found for cs.CC. https://arxiv.org/list/cs.CC/new
[1/1]:
- Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
Tomoyuki Yamakami

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Hierarchy of percolation patterns in a kinetic replication model
P. Ovchinnikov, K. Soldatov, V. Kapitan, G. Y. Chitov

Universal Analog Computation: Fra\"iss\'e limits of dynamical systems
Levin Hornischer
https://arxiv.org/abs/2510.10184 https://arxiv.org/pdf/2510…

Universal Analog Computation: Fraïssé limits of dynamical systems
Analog computation is an alternative to digital computation, that has recently re-gained prominence, since it includes neural networks. Further important examples are cellular automata and differential analyzers. While analog computers offer many advantages, they lack a notion of universality akin to universal digital computers. Since analog computers are best formalized as dynamical systems, we review scattered results on universal dynamical systems, identifying four senses of universality and…

Sharpness for monotone absorbing Interacting Particle Systems
Jean B\'erard (IRMA), Barbara Dembin (IRMA), Laure Mar\^ech\'e (IRMA)
https://arxiv.org/abs/2510.11424 http…

Sharpness for monotone absorbing Interacting Particle Systems
We prove a sharpness result for the dynamics of finite-range Interacting Particle Systems (IPS) on $\{0,1\}^{\mathbb Z^d}$. Starting from an IPS that is monotone, ergodic, and which admits the all-zero configuration as an absorbing state, we prove that there exists an arbitrarily small perturbation of the dynamics which leads to an \emph{exponentially} ergodic IPS. This extends the sharpness result previously established for (discrete-time) probabilistic cellular automata in \cite{Har} to the c…

A Rotation-Invariant Embedded Platform for (Neural) Cellular Automata
Dominik Woiwode, Jakob Marten, Bodo Rosenhahn
https://arxiv.org/abs/2510.07440 https://

A Rotation-Invariant Embedded Platform for (Neural) Cellular Automata
This paper presents a rotation-invariant embedded platform for simulating (neural) cellular automata (NCA) in modular robotic systems. Inspired by previous work on physical NCA, we introduce key innovations that overcome limitations in prior hardware designs. Our platform features a symmetric, modular structure, enabling seamless connections between cells regardless of orientation. Additionally, each cell is battery-powered, allowing it to operate independently and retain its state even when di…

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Can ChatGPT support software verification?
Christian Jan{\ss}en, Cedric Richter, Heike Wehrheim

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Squeezing codes: robust fluctuation-stabilized memories
Ethan Lake, Sunghan Ro

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Flavors of Quantifiers in Hyperlogics
Marek Chalupa, Thomas A. Henzinger, Ana Oliveira da Costa

Efficient Decomposition Identification of Deterministic Finite Automata from Examples
Junjie Meng, Jie An, Yong Li, Andrea Turrini, Fanjiang Xu, Naijun Zhan, Miaomiao Zhang
https://arxiv.org/abs/2509.24347

Efficient Decomposition Identification of Deterministic Finite Automata from Examples
The identification of deterministic finite automata (DFAs) from labeled examples is a cornerstone of automata learning, yet traditional methods focus on learning monolithic DFAs, which often yield a large DFA lacking simplicity and interoperability. Recent work addresses these limitations by exploring DFA decomposition identification problems (DFA-DIPs), which model system behavior as intersections of multiple DFAs, offering modularity for complex tasks. However, existing DFA-DIP approaches dep…

Exploring one-dimensional, binary, radius-2 cellular automata, over cyclic configurations, in terms of their ability to solve decision problems by distributed consensus
Eurico Ruivo, Pedro Paulo Balbi, K\'evin Perrot, Marco Montalva-Medel, Eric Goles
https://arxiv.org/abs/2510.01040

Exploring one-dimensional, binary, radius-2 cellular automata, over cyclic configurations, in terms of their ability to solve decision problems by distributed consensus
Probing the ability of automata networks to solve decision problems has received a continuous attention in the literature, and specially with the automata reaching the answer by distributed consensus, i.e., their all taking on a same state, out of two. In the case of binary automata networks, regardless of the kind of update employed, the networks should display only two possible attractors, the fixed points $0^L$ and $1^L$, for all cyclic configurations of size $L$. A previous investigation in…

Crosslisted article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Scaling Properties of Avalanche Activity in the Two-Dimensional Abelian Sandpile Model
Anubhav Ganguly

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
Antonina Nepeivoda, Ilya Afanasyev

from my link log —
Index 1,600,000,000 keys with finite state automata and Rust.
https://blog.burntsushi.net/transducers/
saved 2021-08-21 https://

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Executable Ontologies: Synthesizing Event Semantics with Dataflow Architecture
Aleksandr Boldachev

For #TextureTuesday some more WIP snapshots of STRATA, a generative system I've been on/off working on since 2014 (in Clojure/TypeScript/Zig, originally for the cover design of HOLO magazine), loosely based on 1950s research/experiments by Barricelli, somewhat related to cellular automata and extended to use a different and much larger set of "reproduction/collision rules" f…

[2025-09-15 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Learn, Check, Test -- Security Testing Using Automata Learning and Model Checking
Stefan Marksteiner, Mikael Sj\"odin, Marjan Sirjani
https://arxiv.org/abs/2509.22215 https…

Learn, Check, Test -- Security Testing Using Automata Learning and Model Checking
Cyber-physical systems are part of industrial systems and critical infrastructure. Therefore, they should be examined in a comprehensive manner to verify their correctness and security. At the same time, the complexity of such systems demands such examinations to be systematic and, if possible, automated for efficiency and accuracy. A method that can be useful in this context is model checking. However, this requires a model that faithfully represents the behavior of the examined system. Obtain…

[2025-10-15 Wed (UTC), 1 new article found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

Unitary Quantum Cellular Automata for Density Classification
Pedro C. S. Costa, Yuval R. Sanders, Pedro Paulo Balbi, Gavin K. Brennen
https://arxiv.org/abs/2510.06947 https://…

Unitary Quantum Cellular Automata for Density Classification
We investigate the density classification task (DCT) -- determining the majority bit in a one-dimensional binary lattice -- within a quantum cellular automaton (CA) framework. While there is no one-dimensional two-state, radius $r \geq 1$, deterministic CA with periodic boundary conditions that solves the DCT perfectly, we explore whether a unitary quantum model can succeed. We employ the Partitioned Unitary Quantum Cellular Automaton (PUQCA), a number-conserving model, and, via evolutionary se…

[2025-10-15 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-10-14 Tue (UTC), 1 new article found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

[2025-09-15 Mon (UTC), no new articles found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

MonochromeEvolutionaryBioDigitalCellularAutomataSimulation
Unlike the recently shared[1] multi-cellular struggles, these here are some selected research stills (handpicked from tens of thousands) of only single CA configurations (aka mono-cultures) which I found interesting/promising and which were then used as raw ingredients/candidates for my infinitely evolving C-SCAPE project[2]...
Each of these cellular automata is 1.5D, meaning each pixel row is one generation, but I allowe…

Tradeoffs on the volume of fault-tolerant circuits
Anirudh Krishna, Gilles Z\'emor
https://arxiv.org/abs/2510.03057 https://arxiv.org/pdf/2510.03057

Tradeoffs on the volume of fault-tolerant circuits
Dating back to the seminal work of von Neumann [von Neumann, Automata Studies, 1956], it is known that error correcting codes can overcome faulty circuit components to enable robust computation. Choosing an appropriate code is non-trivial as it must balance several requirements. Increasing the rate of the code reduces the relative number of redundant bits used in the fault-tolerant circuit, while increasing the distance of the code ensures robustness against faults. If the rate and distance wer…

[2025-10-14 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Proceedings of the Sixteenth International Symposium on Games, Automata, Logics, and Formal Verification
Giorgio Bacci (Aalborg University, Denmark), Adrian Francalanza (University of Malta)
https://arxiv.org/abs/2509.13258

Proceedings of the Sixteenth International Symposium on Games, Automata, Logics, and Formal Verification
This volume contains the proceedings of GandALF 2025, the Sixteenth International Symposium on Games, Automata, Logics, and Formal Verification. GandALF 2025 took place on 16-17th September 2025, in Valletta, Malta. The aim of GandALF 2025 is to bring together researchers from academia and industry who are actively working in the fields of Games, Automata, Logics, and Formal Verification. The idea is to cover an ample spectrum of themes, ranging from theory to applications, and stimulate cross-…

Bringing Algebraic Hierarchical Decompositions to Concatenative Functional Languages
Attila Egri-Nagy
https://arxiv.org/abs/2510.12481 https://arxiv.org/pd…

Bringing Algebraic Hierarchical Decompositions to Concatenative Functional Languages
Programming languages tend to evolve over time to use more and more concepts from theoretical computer science. Still, there is a gap between programming and pure mathematics. Not all theoretical results have realized their promising applications. The algebraic decomposition of finite state automata (Krohn-Rhodes Theory) constructs an emulating hierarchical structure from simpler components for any computing device. These decompositions provide ways to understand and control computational proce…

Structured Sparse Transition Matrices to Enable State Tracking in State-Space Models
Aleksandar Terzi\'c, Nicolas Menet, Michael Hersche, Thomas Hofmann, Abbas Rahimi
https://arxiv.org/abs/2509.22284

Structured Sparse Transition Matrices to Enable State Tracking in State-Space Models
Modern state-space models (SSMs) often utilize transition matrices which enable efficient computation but pose restrictions on the model's expressivity, as measured in terms of the ability to emulate finite-state automata (FSA). While unstructured transition matrices are optimal in terms of expressivity, they come at a prohibitively high compute and memory cost even for moderate state sizes. We propose a structured sparse parametrization of transition matrices in SSMs that enables FSA state tra…

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Parameterized Verification of Timed Networks with Clock Invariants
\'Etienne Andr\'e, Swen Jacobs, Shyam Lal Karra, Ocan Sankur

Unreliability in Practical Subclasses of Communicating Systems
Amrita Suresh, Nobuko Yoshida
https://arxiv.org/abs/2510.03941 https://arxiv.org/pdf/2510.03…

Unreliability in Practical Subclasses of Communicating Systems
Systems of communicating automata are prominent models for peer-to-peer message-passing over unbounded channels, but in the general scenario, most verification properties are undecidable. To address this issue, two decidable subclasses, Realisable with Synchronous Communication (RSC) and k-Multiparty Compatibility} (k-MC), were proposed in the literature, with corresponding verification tools developed and applied in practice. Unfortunately, both RSC and k-MC are not resilient under failures: (…

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
Rafig Huseynzade

Some nonabelian subgroups of the Nottingham group over F_4
Kevin Keating
https://arxiv.org/abs/2509.18300 https://arxiv.org/pdf/2509.18300

Explainable AI-Enhanced Supervisory Control for Robust Multi-Agent Robotic Systems
Reza Pirayeshshirazinezhad, Nima Fathi
https://arxiv.org/abs/2509.15491 https://

Explainable AI-Enhanced Supervisory Control for Robust Multi-Agent Robotic Systems
We present an explainable AI-enhanced supervisory control framework for multi-agent robotics that combines (i) a timed-automata supervisor for safe, auditable mode switching, (ii) robust continuous control (Lyapunov-based controller for large-angle maneuver; sliding-mode controller (SMC) with boundary layers for precision and disturbance rejection), and (iii) an explainable predictor that maps mission context to gains and expected performance (energy, error). Monte Carlo-driven optimization pro…

[2025-10-13 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Training the classification capability of large-scale quantum cellular automata
Mario Boneberg, Simon Kochsiek, Gabriele Perfetto, Igor Lesanovsky
https://arxiv.org/abs/2509.18262

[2025-10-13 Mon (UTC), no new articles found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
Pablo Concha-Vega, Eric Goles, Pedro Montealegre, K\'evin Perrot
https://arxiv.org/abs/2509.16065 https:…

Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states $\{-1,+1\}$, where the local interactions are based on an L-shaped neighborhood structure. In these automata, once a cell reaches state $+1$, it remains fixed in that state forever, while cells in state $-1$ update to the most represented state among their neighborhoods. We consider L-shaped neighborhoods, which mean that the vicinity of a given cell $c$ cons…

Languages of Words of Low Automatic Complexity Are Hard to Compute
Joey Chen, Bj{\o}rn Kjos-Hanssen, Ivan Koswara, Linus Richter, Frank Stephan
https://arxiv.org/abs/2510.07696 …

Languages of Words of Low Automatic Complexity Are Hard to Compute
The automatic complexity of a finite word (string) is an analogue for finite automata of Sipser's distinguishing complexity (1983) and was introduced by Shallit and Wang (2001). For a finite alphabet $Σ$ of at least two elements, we consider the non-deterministic automatic complexity given by exactly - yet not necessarily uniquely - accepting automata: a word $x \in Σ^*$ has exact non-deterministic automatic complexity $k \in \mathbb{N}$ if there exists a non-deterministic automaton of $k$ st…

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Orbits of One-Dimensional Cellular Automata Induced by Symmetry Transformations
Martin Schaller, Karl Svozil

Passive Learning of Lattice Automata from Recurrent Neural Networks
Jaouhar Slimi, Tristan Le Gall, Augustin Lemesle
https://arxiv.org/abs/2509.22489 https://

Passive Learning of Lattice Automata from Recurrent Neural Networks
We present a passive automata learning algorithm that can extract automata from recurrent networks with very large or even infinite alphabets. Our method combines overapproximations from the field of Abstract Interpretation and passive automata learning from the field of Grammatical Inference. We evaluate our algorithm by first comparing it with the state-of-the-art automata extraction algorithm from Recurrent Neural Networks trained on Tomita grammars. Then, we extend these experiments to regu…

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
Massimo Benerecetti (Universit\`a degli Studi di Napoli "Federico II"), Dario Della Monica (Universit\`a degli Studi di Udine), Angelo Matteo (Universit\`a degli Studi di Udine), Fabio Mogavero (Universit\`a degli Studi di Napoli "Federico II"), Gabriele Puppis (Universit\`a degli Studi di Udine)

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
In this paper, we study First Order Logic (FO) over (unordered) infinite trees and its connection with branching-time temporal logics. More specifically, we provide an automata-theoretic characterisation of FO interpreted over infinite trees. To this end, two different classes of hesitant tree automata are introduced and proved to capture precisely the expressive power of two branching time temporal logics, denoted polcCTLp and cCTL*[f], which are, respectively, a restricted version of counti…

Crosslisted article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Local active error correction from simulated confinement
Ethan Lake
https:…

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Homomorphism Problems in Graph Databases and Automatic Structures
R\'emi Morvan

[2025-10-10 Fri (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

The Role of Logic and Automata in Understanding Transformers
Anthony W. Lin, Pablo Barcelo
https://arxiv.org/abs/2509.24024 https://arxiv.org/pdf/2509.2402…

The Role of Logic and Automata in Understanding Transformers
The advent of transformers has in recent years led to powerful and revolutionary Large Language Models (LLMs). Despite this, our understanding on the capability of transformers is still meager. In this invited contribution, we recount the rapid progress in the last few years to the question of what transformers can do. In particular, we will see the integral role of logic and automata (also with some help from circuit complexity) in answering this question. We also mention several open problems…

A Unifying Approach to Picture Automata
Yvo Ad Meeres, Franti\v{s}ek Mr\'az
https://arxiv.org/abs/2509.12077 https://arxiv.org/pdf/2509.12077

A Unifying Approach to Picture Automata
A directed acyclic graph (DAG) can represent a two-dimensional string or picture. We propose recognizing picture languages using DAG automata by encoding 2D inputs into DAGs. An encoding can be input-agnostic (based on input size only) or input-driven (depending on symbols). Three distinct input-agnostic encodings characterize classes of picture languages accepted by returning finite automata, boustrophedon automata, and online tessellation automata. Encoding a string as a simple directed path …

[2025-10-09 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
Tomoyuki Yamakami

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Completing the picture for the Skolem Problem on order-4 linear recurrence sequences
Piotr Bacik

Crosslisted article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Consistent kinetic modeling of compressible flows with variable Prandtl numbers: Double-distribut...
R. M. Str\"assle, S. A. Hosseini, I. V. Karlin

How Concise are Chains of co-B\"uchi Automata?
R\"udiger Ehlers
https://arxiv.org/abs/2509.14087 https://arxiv.org/pdf/2509.14087

How Concise are Chains of co-Büchi Automata?
Chains of co-Büchi automata (COCOA) have recently been introduced as a new canonical model for representing arbitrary omega-regular languages. They can be minimized in polynomial time and are hence an attractive language representation for applications in which normally, deterministic omega-automata are used. While it is known how to build COCOA from deterministic parity automata, little is currently known about their relationship to automaton models introduced earlier than COCOA. In this pa…

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Quantitative Semantics for Jumping Automata
Shaull Almagor (Technion), Neta Dafni (Technion), Ishai Salgado (Technion)

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Unreliability in Practical Subclasses of Communicating Systems
Amrita Suresh, Nobuko Yoshida

[2025-10-08 Wed (UTC), 1 new article found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Unraveling Syntax: How Language Models Learn Context-Free Grammars
Laura Ying Schulz, Daniel Mitropolsky, Tomaso Poggio

[2025-10-06 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Learn, Check, Test -- Security Testing Using Automata Learning and Model Checking
Stefan Marksteiner, Mikael Sj\"odin, Marjan Sirjani

[2025-10-07 Tue (UTC), no new articles found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

Active Learning of Symbolic Mealy Automata
Kengo Irie, Masaki Waga, Kohei Suenaga
https://arxiv.org/abs/2509.14694 https://arxiv.org/pdf/2509.14694

Active Learning of Symbolic Mealy Automata
We propose $Λ^*_M$-an active learning algorithm that learns symbolic Mealy automata, which support infinite input alphabets and multiple output characters. Each of these two features has been addressed separately in prior work. Combining these two features poses a challenge in learning the outputs corresponding to potentially infinite sets of input characters at each state. To address this challenge, we introduce the notion of essential input characters, a finite set of input characters that i…

Weighted Automata for Exact Inference in Discrete Probabilistic Programs
Dominik Gei{\ss}ler, Tobias Winkler
https://arxiv.org/abs/2509.15074 https://arxiv…

Weighted Automata for Exact Inference in Discrete Probabilistic Programs
In probabilistic programming, the inference problem asks to determine a program's posterior distribution conditioned on its "observe" instructions. Inference is challenging, especially when exact rather than approximate results are required. Inspired by recent work on probability generating functions (PGFs), we propose encoding distributions on $\mathbb{N}^k$ as weighted automata over a commutative alphabet with $k$ symbols. Based on this, we map the semantics of various imperative programming …

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- The Glider Equation for Asymptotic Lenia
Hiroki Kojima, Ivan Yevenko, Takashi Ikegami

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Fibrational Perspectives on Determinization of Finite-State Automata
Thea Li
https:…

[2025-10-06 Mon (UTC), no new articles found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Temporally Non-Uniform Cellular Automata: Surjectivity, Reversibility and Cyclic Behavior
Subrata Paul, Sukanta Das

[2025-10-03 Fri (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Cobham's theorem for the Gaussian integers
\'Alvaro Bustos-Gajardo, Robbert Fokkink, Reem Yassawi

Crosslisted article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Phase transition from localization to chaos in classical many-body system
Yusuf Kasim, Pavel Orlov, Toma\v{z} Prosen

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Time for Timed Monitorability
Thomas M. Grosen, Sean Kauffman, Kim G. Larsen, Martin Zimmermann

[2025-10-02 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Monitoring Timed Properties (Revisited)
Thomas M{\o}ller Grosen, Sean Kauffman, Kim Guldstrand Larsen, Martin Zimmermann

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Algorithmical Aspects of Some Bio Inspired Operations
Marius Dumitran
https://…

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Balanced Fibonacci word rectangles, and beyond
Jeffrey Shallit, Ingrid Vukusic
h…

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- A substitution lemma for multiple context-free languages
Andrew Duncan, Murray Elder, Lisa Frenkel, Mengfan Lyu

[2025-10-03 Fri (UTC), 1 new article found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Temporally Non-Uniform Cellular Automata: Surjectivity, Reversibility and Cyclic Behavior
Subrata Paul, Sukanta Das

[2025-10-02 Thu (UTC), no new articles found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

[2025-10-01 Wed (UTC), no new articles found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

[2025-09-30 Tue (UTC), 2 new articles found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- A Variety of Request-Response Specifications
Aiba, Waga, Fujinami, Muroya, Ouchi, Ueda, Yokoyama, Wada, Hasuo

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Formalization of Harder-Narasimhan theory
Yijun Yuan
https://

[2025-09-29 Mon (UTC), 2 new articles found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
Tomoyuki Yamakami

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Petri Nets-based Methods on Automatically Detecting for Concurrency Bugs in Rust Programs
Kaiwen Zhang, Guanjun Liu

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- AD-VF: LLM-Automatic Differentiation Enables Fine-Tuning-Free Robot Planning from Formal Methods ...
Yunhao Yang, Junyuan Hong, Gabriel Jacob Perin, Zhiwen Fan, Li Yin, Zhangyang Wang, Ufuk Topcu

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Stratifiable formulae are not context-free
Calliope Ryan-Smith
https://

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Learning Verified Monitors for Hidden Markov Models
Luko van der Maas, Sebastian Junges

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Reduced complexities for sequences over finite alphabets
John M. Campbell, James Currie, Narad Rampersad

[2025-09-26 Fri (UTC), no new articles found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

[2025-09-25 Thu (UTC), no new articles found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

[2025-09-24 Wed (UTC), 1 new article found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

Crosslisted article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Exploring Major Transitions in the Evolution of Biological Cognition With Artificial Neural Networks
Konstantinos Voudouris, Andrew Barron, Marta Halina, Colin Klein, Matishalin Patel