22 papers · ranked by Valyu relevance
Sabah Al‐Fedaghi
The design of complex man-made systems mostly involves a conceptual modeling phase; therefore, it is important to ensure an appropriate analysis method for these models. A key concept for such analysis is the development of a diagramming technique (e.g., UML) because diagrams can describe entities and processes and…
Ralph P. Lano
This paper presents the implementation of a self-replicating finite-state machine (FSM) and a self-replicating Turing Machine (TM) using bio-inspired mechanisms. Building on previous work that introduced self-replicating structures capable of sorting, copying, and reading information, this study demonstrates the…
Sierra Zoe Bennett-Manke, Sebastian Neumann, Roberta L. Dougherty
layout the states and transitions in a logical way, which may be different depending on the machine's behavior. Further, although using a static representation can be useful in the classroom, rendering a simulation of the machine by-hand takes valuable time, and updating the simulation's multiple data can be initially…
Jovan Milojković, Srdjan Brkić, Predrag Ivaniš, Bane Vasić + 1 more
'Jun Chen'] In this paper, we introduce a novel gradient descent bit-flipping algorithm with a finite state machine (GDBF-wSM) for iterative decoding of low-density parity-check (LDPC) codes. The algorithm utilizes a finite state machine to update variable node potentials-for each variable node, the corresponding…
Tijana Minić, Marco T. Morazán
The transformation of a nondeterministic finite-state automaton into a deterministic finite-state automaton is an integral part of any course on formal languages and automata theory. For some students, understanding this transformation is challenging. Common problems encountered include not comprehending how the states…
Jun Wang, Xiaokang Zhang, Peijun Shi, Ben Cao + 2 more
'Keng-Shiang Huang'] Living organisms can produce corresponding functions by responding to external and internal stimuli, and this irritability plays a pivotal role in nature. Inspired by such natural temporal responses, the development and design of nanodevices with the ability to process time-related information…
Ricardo Almeida
While regexp matching is a powerful mechanism for finding patterns in data streams, regexp engines in general only find matches that do not overlap. Moreover, different forms of nondeterministic exploration, where symbols read are processed more than once, are often used, which can be costly in real-time matching. We…
Hui Tian, Xin Su, Yanfang Hou
Background As an important mathematical model, the finite state machine (FSM) has been used in many fields, such as manufacturing system, health care, and so on. This paper analyzes the current development status of FSMs. It is pointed out that the traditional methods are often inconvenient for analysis and design, or…
Chris Salzberg, Hiroki Sayama
We explore the dynamics of a one-dimensional lattice of state machines on two states and two symbols sequentially updated via a process of "reflexive composition." The space of 256 machines exhibits a variety of behavior, including substitution, reversible "billiard ball" dynamics, and fractal nesting. We show that one…
Alexandra Bernadotte
This paper is devoted to finite state automata, regular expression matching, pattern recognition, and the exponential blow-up problem, which is the growing complexity of automata exponentially depending on regular expression length. This paper presents a theoretical and hardware solution to the exponential blow-up…
Qingkai Shi, Xiangzhe Xu, Xiangyu Zhang
Reverse engineering of protocol message formats is critical for many security applications. Mainstream techniques use dynamic analysis and inherit its low-coverage problem — the inferred message formats only reflect the features of their inputs. To achieve high coverage, we choose to use static analysis to infer…
Benjamin D. Johnson, James P. Crutchfield, Christopher J. Ellison, Carl S. McTague + 1 more
'Carl S. McTague' 'Nikolai Leonenko'] We show how to efficiently enumerate a class of finite-memory stochastic processes using the causal representation of $ϵ$-machines. We characterize $ϵ$-machines in the language of automata theory and adapt a recent algorithm for generating accessible deterministic finite automata…
Kyrell Vann Verano, Emanuele Panizon, Antonio Celani
Long-range olfactory search is an extremely difficult task in view of the sparsity of odor signals that are available to the searcher and the complex encoding of the information about the source location. Current algorithmic approaches typically require a continuous memory space, sometimes of large dimensionality…
Giorgio Nicoletti, Antonio Celani
Understanding how living organisms process sensory information from their surroundings and translate it into decisions is a fundamental problem across biological scales – from biochemical signalling in single-cells to neural computations in animal brains. In this work, we address this challenge by introducing a method…
Authors not listed
Quantitative Structure Activity Relationship (QSAR) remains an effective tool for early-stage chemical modelling and virtual screening in drug design. The advancements in this field are led by two core paradigms, 1) descriptor engineering, where complex fixed-length vectors of compounds are generated and conventional…
Alexis Dubreuil, Arthur Leblois, Rémi Monasson
Elaborated temporal structures in behavior have been recognized as a hall-mark of high-level cognitive processes, such as planning or natural language. Systems neuroscience experiments in behaving animals have validated cell-assemblies as a fundamental piece of neural circuitry underlying lower-level cognitive…
Elena D’Ambrosio, Zhou Fang, Ankit Gupta, Sant Kumar + 1 more
Time-lapse microscopy has become increasingly prevalent in biological experimentation, as it provides single-cell trajectories that unveil valuable insights into underlying networks and their stochastic dynamics. However, the limited availability of fluorescent reporters typically constrains tracking to only a few…
George Chao, Evan Appleton, Clair S. Gutierrez, Lilia Evgeniou + 4 more
Pluripotent cells specialize into numerous cell types by receiving external signals, making fate decisions, and executing differentiation functions – a paradigm similar to computer algorithms. While advances in biosensor design have enabled cells to respond to diverse stimuli, the ability to maintain a synthetic memory…
Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis
We settle the parameterized complexities of several variants of independent set reconfiguration and dominating set reconfiguration, parameterized by the number of tokens. We show that both problems are XL-complete when there is no limit on the number of moves, XNL-complete when a maximum length $\ell$ for the sequence…
James P. Crutchfield, Antonio M. Scarfone
We show that mixtures comprising multicomponent systems typically are much more structurally complex than the sum of their parts; sometimes, infinitely more complex. We contrast this with the more familiar notion of statistical mixtures, demonstrating how statistical mixtures miss key aspects of emergent hierarchical…
Authors not listed
Deriving versatile and robust mechanistic models from experimental data is a key challenge in engineering and natural sciences. This is especially true in chemical reaction engineering, where reactor manufacturers and operators increasingly pursue the development and maintenance of digital twins that rely on frequent…
Authors not listed
Digital twins are virtual companions for the design, scale-up, and control of chemical processes. Equipping digital twins with mechanistic models of their mirrored unit operation expands their range of applicability compared to pure data-driven models. As constructing mechanistic models requires time, effort, and…