Results 261 to 270 of about 283,589 (317)

A seven-step guide to spatial, agent-based modelling of tumour evolution. [PDF]

Evol Appl
Colyer B, Bak M, Basanta D, Noble R.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Exact Searching for the Smallest Deterministic Automaton

International Conference on Conceptual Structures, 2021
We propose an approach to minimum-state deterministic finite automaton (DFA) inductive synthesis that is based on using satisfiability modulo theories (SMT) solvers. To that end, we explain how DFAs and their response to input samples can be encoded as logic formulas with integer variables, equations, and uninterpreted functions.
Wojciech Wieczorek, Łukasz Strąk, Arkadiusz Nowakowski, Olgierd Unold   +3 more
openaire   +2 more sources

Self-organized criticality in a deterministic automaton

Physical Review Letters, 1990
We study a deterministic version of the cellular automaton first shown to display self-organized criticality. Detailed analysis shows that there exist many coexisting periodic attractors, with a period that is independent of initial condition. This leads us to picture the critical state as the union of many such coexisting, neutrally stable orbits ...
, Wiesenfeld, , Theiler, , McNamara
openaire   +3 more sources

Construction of a Deterministicω-Automaton Using Derivatives

RAIRO - Theoretical Informatics and Applications, 1999
Summary: A deterministic automaton recognizing a given \(\omega\)-regular language is constructed from an \(\omega\)-regular expression with the help of derivatives. The construction is related to Safra's algorithm, in about the same way as the classical derivative method is related to the subset construction.
Roman R. Redziejowski
openaire   +3 more sources

On Minimization of Deterministic Automaton with Rough Output

International Conference on Theoretical Computer Science and Discrete Mathematics, 2017
The purpose of the present work is to introduce and study the concept of minimal deterministic automaton with rough output which recognizes the given rough languages. Specifically, we use two concepts for such construction, one is based on Myhill-Nerode’s theory and the other is on the basis of derivatives of the given rough language.
B. K. Sharma, S. Sharan, S. P. Tiwari
openaire   +2 more sources

An Improved Construction of Deterministic Omega-automaton Using Derivatives

Fundamenta Informaticae, 2012
In an earlier paper, the author used derivatives to construct a deterministic automaton recognizing the language defined by an ω-regular expression. The construction was related to a determinization method invented by Safra. This paper describes a new construction, inspired by Piterman's improvement to Safra's method.
Roman R. Redziejowski
openaire   +3 more sources

Control of a Deterministic Automaton Using Stochastic Information

IFAC Proceedings Volumes, 1981
Abstract In this communication, a new control problem of a deterministic automaton is presented and solved . The purpose is to place exactly the automaton in a pre-specified final state from an unknown initial state, in using stochastic information on state-classes . In the modelling of the controlled automaton, a prediction phase and an updating one
M. Naranjo, M. Richetin
openaire   +2 more sources

A regular expression matching using non-deterministic finite automaton

Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010), 2010
This paper shows an implementation of CANSCID (Combined Architecture for Stream Categorization and Intrusion Detection). To satisfy the required system throughput, the packet assembler and the regular expression matching are implemented by the dedicated hardware. On the other hand, the counting of matching results and the system control are implemented
Hiroki Nakahara, Tsutomu Sasao, Munehiro Matsuura   +2 more
openaire   +2 more sources