The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A finite automaton with an output is with bounded delay if the length of the input and the length of the output have a bounded difference. ... For this aim the classical theory of finite automata—which considers automata with initial states—is not adequate, and a new approach is necessary. ...
, coding theory and filtering for sequential systems, general dynamical systems and categorical approach to systems. ... The aim of the conference was to encourage fruitful, active collaboration between researchers working in the diverse areas of systems theory and on the purely mathematical problems raised by systems theory ... General dynamical systems and categorical approach to systems -H. Ehrig, H. J. ...doi:10.1016/0771-050x(77)90024-9 fatcat:7tfccvyx6ndufgblekd55mn6fa
Wiatjen, Dietmar 84f:18006a A generalization of the input and output process approach to categorical automata-theory. (German and Russian summaries) Elektron. Informationsverarb. ... An input process [resp. output process] generates a free algebraic theory X°=(X@,n,) [resp. a cofree algebraic cotheory Xq =(X@,€,)]. (In the case that X¥=- XX), X©=-X XF and X@= (—)*°.) ...
The unified approach is expressed in the terminology of category theory, based on the Arbib-Manes approach to categorical automata and machine theory [M. A. Arbib and E. G. ... The author aims at a unified approach to generalized sequential machines [J. W. ...
We provide a general theory of optimal realization, generalizing the minimal realization construction of automata theory. ... We use a categorical framework to capture general classes of deterministic and nondeterministic realization problems. ... The aim of this paper is to provide a general theory of optimal realization, generalizing the minimal realization of automata theory in order to include minimum information-theoretic dispersion and optimal ...doi:10.1016/0022-0000(85)90047-9 fatcat:2qpj4a2inba7dbopcmeuqxz2ei
In this paper we describe a general approach, based on the tile model, to the definition of the operational seman- tics of process calculi. ... In detail, we present a series of encod- ings for languages with (1) input-guarded choice, (2) both input- and output-guarded choice, and (3) mixed-guarded choice, and investigate them with respect to ...
compared to state-of-the-art approaches. ... Input is randomly projected onto the initial conditions of automaton cells and nonlinear computation is performed on the input via application of a rule in the automaton for a period of time. ... This output is a projection of the input onto a nonlinear cellular automata state space. ...arXiv:1410.0162v1 fatcat:phm4z7o45fdnnkmm6qf5oakosa
as an X-indexed family 6, : Q-Q of unary operations, and that much of sequential machine theory could be generalized from the string-processing of sequential machines to tree-processing wherein the unary ... We think of Q as the internal state space of a system with m input lines and p output lines. ... A bisequence of x'-morphisms ofform Hk .Llachines in a caleyor? ...doi:10.1016/0022-4049(80)90090-0 fatcat:eylerllivff7holujcxxug6j74
The payoffs are: (1) explicit relations to existing models and semantics, especially the usual axioms of monotone IO automata are read off from the definition of profunctors, (2) a new definition of bisimulation ... the geometry of interaction programme. 1. the general functoriality and naturality properties of presheaves automatically imply the usually postulated axioms for asynchronous, monotone automata [27, 32 ... dataflow composition as relational composition, dataflow processes as categorical constructs and the very concrete views of dataflow networks as port automata and as sequences of events encoding causality ...doi:10.1017/s0960129504004293 fatcat:wtfyjpeubnckjgnqytosrfk5uy
Algebraic theory of stochastic automata—a categorical approach. Serdica 4 (1978), no. 4, 277-288. ... A functor L from AS to the category A” of deterministic automata is constructed and the existence of a left adjoint for L is proved. ...
apparatus necessary to facilitate the connection between the automaton approach and the categorical approach to the theory of algebras considered as automata. ... COMPUTATION STRUCTURES FOR ALGEBRA AUTOMATA Our approach in Part I is non-categorical, and is intended, inter alia, to provide a bridge between ordinary automata theory and computer science on the one ...doi:10.1016/s0019-9958(68)90374-4 fatcat:lyicij34djbgfnjnosyhhjy55e
BRICS Report Series
The payoffs are: (1) explicit relations to existing models and semantics, especially the<br />usual axioms of monotone IO automata are read off from the definition of profunctors, (2) a new definition ... We recast dataflow in a modern categorical light using profunctors as a generalization of relations. ... The context is a fork process F (a process that copies every input to two outputs), through which the output of the automata A i is fed back to the input channel. ...doi:10.7146/brics.v4i36.18962 fatcat:obwrls2dfnaxjdf4gv6ven5sl4
Lecture Notes in Computer Science
The payoffs are: (1) explicit relations to existing models and semantics, especially the usual axioms of monotone IO automata are read off from the definition of profunctors, (2) a new definition of bisimulation ... The development fits with the view of categories of models for concurrency and the general treatment of bisimulation they provide. ... The context consists of a fork process (a process that copies every input to two outputs), through which the output of the automata ¡ is fed back to the input channel, as shown in Fig. 1 . ...doi:10.1007/bfb0055651 fatcat:taochqxyincutckqi5j6ieleyq
Basic properties of CGFk-processes are investigated.” 68D Automata See also 03049, 16046, 60100, 68091. Thomas, Wolfgang A combinatorial approach to the theory of w-automata. ... Inform. and Control 48 (1981), no. 3, 261-283. The author presents a new approach to the theory of automata that recognize infinite words. ...
Due to the necessity to represent the creation of new channels, in nite automata are obtained in this case also for very simple agents and a non-standard de nition of bisimulation is required. ... In this paper we present an enhanced version of automata, called history dependent automata, that are adequate to represent the operational semantics ofcalculus and of other history dependent formalisms ... Notice that, in the case of the -calculus, the actions a process can perform are di erent from the pre xes. This happens due to the input and to the bound output. ...doi:10.1016/s1571-0661(05)80696-6 fatcat:lvy6ubdmozcsrdt3jlkeznljj4
« Previous Showing results 1 — 15 out of 4,056 results