Results 111 to 120 of about 40,986 (266)
Approximate Equivalence of the Hybrid Automata with Taylor Theory
Hybrid automaton is a formal model for precisely describing a hybrid system in which the computational processes interact with the physical ones.
Anping He+3 more
doaj +1 more source
Cayley automaton semigroups [PDF]
In this paper we characterize when a Cayley automaton semigroup is a group, is trivial, is finite, is free, is a left zero semigroup, or is a right zero semigroup.
arxiv
Topological Structures Induced by General Fuzzy Automata Based on Lattice-ordered Monoid
The fundamental role of algebraic properties in the development of the basics of computer science has led researchers to study the concepts of fuzzy automaton separatedness, connectedness, and reversibility on a large scale.In this paper, the general ...
khadijeh abolpour
doaj
Automaton semigroups: new construction results and examples of non-automaton semigroups [PDF]
This paper studies the class of automaton semigroups from two perspectives: closure under constructions, and examples of semigroups that are not automaton semigroups. We prove that (semigroup) free products of finite semigroups always arise as automaton semigroups, and that the class of automaton monoids is closed under forming wreath products with ...
arxiv
A novel type of Automata for dynamic, heterogeneous and random architectures [PDF]
In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a computing unit, a sequential automaton is employed to describe some state transitions, a hierarchical automaton ...
arxiv
CELLULAR AUTOMATON FOR THE FRACTURE OF ELASTIC MEDIA [PDF]
Peter Ossadnik
openalex +1 more source
Simulation of pedestrian dynamics using a two dimensional cellular automaton [PDF]
Carsten Burstedde+3 more
semanticscholar +1 more source
Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton [PDF]
The problem of computing the edit-distance between a string and a finite automaton arises in a variety of applications in computational biology, text processing, and speech recognition. This paper presents linear-space algorithms for computing the edit-distance between a string and an arbitrary weighted automaton over the tropical semiring, or an ...
arxiv
Abstract Purpose To compare plan quality among photon volumetric modulated arc therapy (VMAT) and intensity‐modulated proton therapy (IMPT) with robustness using three different proton beam delivery systems with various spot size (σ) ranges: cyclotron‐generated proton beams (CPBs) (σ: 2.7–7.0 mm), linear accelerator proton beams (LPBs) (σ: 2.9–5.5 mm),
Tara Gray+9 more
wiley +1 more source