Results 11 to 20 of about 101,866 (227)
International Journal of Adaptive Control and Signal Processing, EarlyView., 2023 Summary In this contribution, we propose a detailed study of interpolation‐based data‐driven methods that are of relevance in the model reduction and also in the systems and control communities. The data are given by samples of the transfer function of the underlying (unknown) model, that is, we analyze frequency‐response data.
Quirin Aumann, Ion Victor Gosea
wiley +1 more source
On the Theory of Stochastic Automata
, 2021 The theory of discrete stochastic systems has been initiated by the work of Shannon and von Neumann. While Shannon has considered memory-less communication channels and their generalization by introducing states, von Neumann has studied the synthesis of reliable systems from unreliable components.
Cakir, Merve Nur +2 more
openaire +2 more sources
Computation Theory of Cellular Automata [PDF]
Communications in Mathematical Physics, 1984 Self-organizing behaviour in cellular automata is discussed as a computational process. Formal language theory is used to extend dynamical systems theory descriptions of cellular automata. The sets of configurations generated after a finite number of time steps of cellular automaton evolution are shown to form regular languages. Many examples are given.
openaire +3 more sources
, 2011 What is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store
Benedikt M. +10 more
core +1 more source
An algebraic theory of interface automata [PDF]
Theoretical Computer Science, 2014 We formulate a compositional specification theory for interface automata, where a component model specifies the allowed sequences of input and output interactions with the environment. A trace-based linear-time refinement is provided, which is the weakest preorder preserving substitutivity of components, and is weaker than the classical alternating ...
Chris Chilton +2 more
openaire +1 more source
Automata finiteness criterion in terms of van der Put series of automata functions
, 2011 In the paper we develop the $p$-adic theory of discrete automata. Every automaton $\mathfrak A$ (transducer) whose input/output alphabets consist of $p$ symbols can be associated to a continuous (in fact, 1-Lipschitz) map from $p$-adic integers to $p ...
Anashin, Vladimir
core +1 more source
Languages, machines, and classical computation [PDF]
, 2021 3rd ed, 2021. A circumscription of the classical theory of computation building up from the Chomsky hierarchy.
Augusto, Luis M.
core
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract) [PDF]
, 2010 The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity.
Bas Luttik +19 more
core +7 more sources
FEBS Letters, EarlyView.The protonated form of butyrate, as well as other short‐chain fatty acids (SCFAs), is membrane permeable. In acidic extracellular environments, this can lead to intracellular accumulation of SCFAs and cytosolic acidification. This phenomenon will be particularly relevant in acidic environments such as the large intestine or tumor microenvironments ...
Muwei Jiang +2 more
wiley +1 more source
A state of a dynamic computational structure distributed in an environment: a model and its corollaries [PDF]
, 2010 Currently there is great interest in computational models consisting of underlying regular computational environments, and built on them distributed computational structures.
Kurgansky, Oleksiy
core +1 more source