A fuzzy irregular cellular automata-based method for the vertex colouring problem by Mostafa Kashani, Saeid Gorgin, Seyed Vahab Shojaedini

“…FICA is an extension fuzzy cellular automaton (FCA) in which the cells of the automaton can be arranged in an irregular structure. …”
Get full text

Stochastic Timed Automata by Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Groesser, Marcin Jurdzinski

“…A stochastic timed automaton is a purely stochastic process defined on a timed automaton, in which both delays and discrete choices are made randomly. …”
Get full text

DeepSynth: Automata synthesis for automatic task segmentation in deep reinforcement learning by Hasanbeig, M, Yogananda Jeppu, N, Abate, A, Melham, TF, Kroening, D

“…The state space of the environment is then enriched with the synthesised automaton so that the generation of a control policy by deep RL is guided by the discovered structure encoded in the automaton. …”

Learning the language of software errors by Chockler, H, Kesseli, P, Kroenig, D, Strichman, O

“…The alphabet of this automaton is given by the user (for instance, a subset of the function call sites or branches), and hence the automaton describes a user-defined abstraction of those scenarios. …”

Unambiguous and finitely ambiguous automata by Widdershoven, C

“…This method expresses the model checking problem as a system of linear equations, given by a product of the automaton and Markov chain combined with a normalising equation for each strongly connected component of this product. …”

MINIMIZATION LOGICAL FUNCTION BY METHOD TO ALTERNATIVE ADAPTATION by Y.O. CHERNYSHEV, N.N. VENCOV

“…The Proposed automaton to adaptation, in the event of hit in local optimum allows to realize return to previous decision. …”
Get full text

Minimal Memory Automata by Benedikt, M, Ley, C, Puppis, G

“…We finally show how this minimal automaton can be computed.…”

Is cell segregation like oil and water: Asymptotic versus transitory regime. by Florian Franke, Sebastian Aland, Hans-Joachim Böhme, Anja Voss-Böhme, Steffen Lange

“…In particular, we demonstrate that the cellular automaton model can exhibit a range of exponents ≤1/3 for such a pseudo-algebraic scaling. …”
Get full text

On the Complexity of Equivalence and Minimisation for Q-weighted Automata by Stefan Kiefer, Andrzej Murawski, Joel Ouaknine, Bjoern Wachter, James Worrell

“…We also give an NC procedure for deciding whether a given automaton is minimal, as well as a randomised NC procedure that minimises an automaton. …”
Get full text

Deciding the value 1 problem for probabilistic leaktight automata by Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Youssouf Oualhadj

“…The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1? …”
Get full text

An efficient algorithm to decide periodicity of $b$-recognisable sets using LSDF convention by Victor Marsault

“…Then, we show that it can be verified in linear time if a minimal automaton meets this description. In general, this yields a $O(b \log(n))$ procedure to decide whether an automaton with $n$ states accepts an ultimately periodic set of nonnegative integers.…”
Get full text

Minimization and Canonization of GFG Transition-Based Automata by Bader Abu Radi, Orna Kupferman

“…Our algorithm is based on a sequence of transformations we apply to the automaton, on top of which a minimal quotient automaton is defined. …”
Get full text

Automata representation for Abelian groups by Fong, Wan Heng, Gan, Yee Siang, Sarmin, Nor Haniza, Turaev, Sherzod

“…A finite automaton is one of the classic models of recognition devices, which is used to determine the type of language a string belongs to. …”
Get full text

ON THE COMPLEXITY OF EQUIVALENCE AND MINIMISATION FOR Q-WEIGHTED AUTOMATA by Kiefer, S, Murawski, A, Ouaknine, J, Wachter, B, Worrell, J

“…We also give an NC procedure for deciding whether a given automaton is minimal, as well as a randomised NC procedure that minimises an automaton. …”

What You Must Remember When Processing Data Words by Benedikt, M, Ley, C, Puppis, G

“…We finally show how this minimal automaton can be computed.…”

On One-Sided, D-Chaotic CA Without Fixed Points, Having Continuum of Periodic Points With Period 2 and Topological Entropy log(p) for Any Prime p by Wit Forys, Janusz Matyja

“…A method is known by which any integer \(\, n\geq2\,\) in a metric Cantor space of right-infinite words \(\,\tilde{A}_{n}^{\,\mathbb N}\,\) gives a construction of a non-injective cellular automaton \(\,(\tilde{A}_{n}^{\,\mathbb N},\,\tilde{F}_{n}),\,\) which is chaotic in Devaney sense, has a radius \(\, r=1,\,\) continuum of fixed points and topological entropy \(\, log(n).\,\) As a generalization of this method we present for any integer \(\, n\geq2,\,\) a construction of a cellular automaton \(\,(A_{n}^{\,\mathbb{N}},\, F_{n}),\,\) which has the listed properties of \(\,(\tilde{A}_{n}^{\,\mathbb N},\,\tilde{F}_{n}),\,\) but has no fixed points and has continuum of periodic points with the period 2. …”
Get full text

Finite State Automata on Multi-Word Units for Efficient Text-Mining by Alberto Postiglione

“…The algorithm, designed to handle the challenges posed by very long multi-word units composed of a variable number of simple words, integrates user-selected ontologies into a single finite automaton during a fast pre-processing step. At runtime, the automaton reads input text character by character, efficiently locating multi-word units even if they overlap. …”
Get full text

Learning and planning with logical automata by Araki, Brandon, Vodrahalli, Kiran, Leech, Thomas, Vasile, Cristian-Ioan, Donahue, Mark, Rus, Daniela

“…We achieve interpretability by modeling the interactions between high-level actions as an automaton with connections to formal logic. We achieve manipulability by integrating this automaton into planning via Logical Value Iteration, so that changes to the automaton have predictable effects on the learned behavior. …”
Get full text

Control of Hidden Mode Hybrid Systems: Algorithm termination by Verma, Rajeev, Del Vecchio, Domitilla

“…We utilize the approach of constructing a new hybrid automaton whose discrete state is an estimate of the HMHS mode. …”
Get full text
Get full text

Pemodelan logika pemeriksaan temporal linier dengan buchi automata=Logic checking linear temporal with buchi automata by Perpustakaan UGM, i-lib

“…Keywords: Modeling, Checking, Reactive system, Temporal Logic, Automaton.…”