The big-O problem by Chistikov, D, Kiefer, SM, Murawski, AS, Purser, D

“…Moreover, even when it is known that one weighted automaton is big-O of another, the problem of finding or approximating the associated constant is also undecidable. …”

Saturation methods for global model-checking pushdown systems by Hague, M

“…These techniques begin with an automaton recognising (higher-order) stacks, and iteratively add new transitions until the automaton becomes saturated.…”

Hybrid control scheme incorporating AFC by Md. Zain, Mohd. Zarhamdy

“…A hybrid system is a dynamic system that exhibits both continuous and discrete dynamic behavior – a system that can both flow (described by a differential equation) and jump (described by a state machine or automaton).…”

Mining stochastic cellular automata to solve density classification task in two dimensions by Nestor Diaz, Irene Tischer

“…Density Classification Task (DCT) is a well-known problem that researchers have been tackling for more than two decades, where the main goal is to build a cellular automaton whose local rule gives rise to emergent global coordination. …”
Get full text

Token Games and History-Deterministic Quantitative-Automata by Udi Boker, Karoliina Lehtinen

“…A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. …”
Get full text

Context-aware environment online monitoring for safety autonomous vehicle systems: an automata-theoretic approach by Yu Zhang, Sijie Xu, Hongyi Chen, Uzair Aslam Bhatt, Mengxing Huang

“…First, the physical environment factors affecting the system are formally described and constructed into an environment model, then the system statute is transformed into a Büchi automaton, and then a synthesis algorithm combining the environment model and the Büchi automaton is designed based on the network of automatons, and the corresponding monitor is generated. …”
Get full text

Automatic functions, linear time and learning by John Case, Sanjay Jain, Frank Stephan, Frank Stephan

“…The present work determines the exact nature of {\em linear time computable} notions which characterise automatic functions (those whose graphs are recognised by a finite automaton). The paper also determines which type of linear time notions permit full learnability for learning in the limit of automatic classes (families of languages which are uniformly recognised by a finite automaton). …”
Get full text

Simulation Research on Fast Matching of Big Data Based on Spark by Guojian Xu, Mingyang Song, Zhenggang Leng, Zhenhong Jia

“…To solve the problem of low efficiency in real-time processing and matching of CNAME records in massive DNS log data, a parallel AC automaton enhancement method based on Spark was proposed. …”
Get full text

The impact of exclusion processes on angiogenesis models by Pillay, S, Byrne, H, Maini, P

“…Using a mean-field approximation, we systematically derive one-dimensional non-linear continuum models from a lattice-based cellular automaton model of angiogenesis in the corneal assay, explicitly accounting for cell volume. …”

Design of autonomous DNA cellular automata by Yin, P, Sahu, S, Turberfield, A, Reif, J

“…In this paper, we describe the design of an Autonomous DNA Cellular Automaton (ADCA), which can perform parallel universal computation by mimicking a one-dimensional (1D) universal cellular automaton. …”

Automata vs. Logics on Data Words by Benedikt, M, Ley, C, Puppis, G

“…In particular, it was shown how to determine, given an automaton, whether or not it is definable in first-order logic with label tests and the order relation, and for first-order logic with the successor relation. …”

Data Replication in Nested Transaction Systems by Goldman, Kenneth J.

“…A formal description of the generalized algorithm is presented using the new Lynch-Merritt input-output automaton model for nested transaction systems.…”
Get full text

Correctness Proof for a Network Synchronizer by Devarajan, Harish, Fekete, Alan, Lynch, Nancy A., Shrira, Liuba

“…We specify both the algorithm and the correctness condition using the I/O automaton model.…”
Get full text

Hazard elimination using backwards reachability techniques in discrete and hybrid models by Neogi, Natasha A. (Natasha Anita), 1976-

Get full text

A Multi-Scale Simulation Approach to Investigate Local Contact Temperatures for Commercial Cu-Full and Cu-Free Brake Pads by Gabriele Riva, Guido Perricone, Jens Wahlström

“…FEA and thermal-CFD are used to set the pressure and the temperature boundary conditions of the cellular automaton. The outputs of dyno tests are used to calibrate FEA and CFD simulations. …”
Get full text

Logic Gates Formed by Perturbations in an Asynchronous Game of Life by Yoshihiko Ohzawa, Yukio-Pegio Gunji

“…The game of life (GL), a type of two-dimensional cellular automaton, has been the subject of many studies because of its simple mechanism and complex behavior. …”
Get full text

Molecular system for an exponentially fast growing programmable synthetic polymer by Nadine Dabby, Alan Barr, Ho-Lin Chen

“…In this sense, a physical Push-Down Automaton can be more powerful than a sequential physical Turing Machine, even though the Turing Machine can compute any computable function. …”
Get full text

Butterfly Effect in Chaotic Image Segmentation by Radu Mărginean, Anca Andreica, Laura Dioşan, Zoltán Bálint

“…We show that, in the context of image segmentation, a butterfly effect arises when we perturb the neighbourhood system of a cellular automaton. Specifically, we enhance a classical GrowCut cellular automaton with chaotic features, which are also able to improve its performance (e.g., a Dice coefficient of 71% in case of 2D images). …”
Get full text

Simulation of composite I/O automata by Solovey, Edward, 1979-

Get full text

Command and Control of Discrete-Event Systems: Towards Online Hierarchical Control Based on Feasible System Decomposition by Ngo, Quang Ha, Seow, Kiam Tian

“…For a command reference input, a new concept for output control feasibility of a discrete-event system modeled by a Moore automaton is characterized; and a system decomposition of a suitably structured Moore automaton into a controllable subsystem and an uncontrollable subsystem is formulated. …”
Get full text
Get full text