A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We present thrc:e possible approaches to a homology theory of automak Two of these require the state space to possess a tolerance. ... This peimits us to proceed by analogy with either the Gmplki~ or the cubic@ theories of the topoh@zal category. The third approach describes a ... We also developed a homology theory for tolerance spaces which was applied to tolerance automata, in particular to those which are stable and inertial. ...doi:10.1016/0012-365x(81)90167-9 fatcat:7fdffl5to5eabdzemlbdnrvdhm
Homology theories and tolerance automata. Discrete Math. 33 (1981), no. 2, 209-221. The paper is a contribution to a homology theory of automata. ... Three approaches are presented of an implementation of homology theory into automata theory. ...
We introduce bicomplexes as an algebraic tool for de- scribing these automata and develop a simple homology theory for higher-dimensional automata. ... We study some possible ways of representing finite semi-automata in computability theory.” 94h:68161 68Q70 68Q10 Goubault, Eric (F-ENS-I; Paris); Jensen, Thomas P. (4-LNDIC-C; London) Homology of higher-dimensional ...
Now ARBIB has pointed to the similarity between automata theory and control theory, linking the two through the concept of a tolerance automaton (Arbib,  ,  ). ... Poston, who has given the most detailed theory of tolerance spaces, employing the usual ideas of product and function space is only able to present a rather obscure homological definition, (POSTON, [3 ...doi:10.1016/0005-1098(66)90011-2 fatcat:sqg2pu2aqzeaxaykiloz6qhb7e
Combinatorial homotopical tools developed in previous works, and consisting essentially of intrinsic homotopy theories for simplicial complexes and directed simplicial complexes, can be applied to explore ... homology groups H n (X) = H n (t X). ... 10, 12] ; -fundamental n-categories for simplicial sets and directed simplicial complexes, in  ; -a study of the (classical) homology theory of simplicial complexes, in  . ...doi:10.4310/hha.2003.v5.n2.a7 fatcat:zlrkqttuprfrhab4dd776p44dm
Greg Plaxton, Highly fault-tolerant sorting circuits (458-469); Ilan Adler and Peter A. ... repre- sentation theory of finite groups (733-742). ...
Glazek, Remarks on polyadic groups and their weak homomorphisms (pp. 133-152); G. Hofer and G. Pilz, Group automata and near-rings (pp. 153-162); G. ... Aczél, A new theory of generalized information measures, recent results in the “old” theory and some “real life” interpretations of old and new information measures (pp. 25-35); C. ...
William Walthall and Duane M. Rumbaugh for their comments and am especially indebted to Evelyn R. Strauss for her valuable criticisms of early drafts of this manuscript. ... I am also grateful to Marc Weissburg and five anonymous reviewers whose criticisms made the final version a better article. Fehruary 1996 ... Automata, grammars, and ribosomes In formal language theory, grammar is viewed as a generator of language. ...doi:10.2307/1312817 fatcat:6ulzujflxffkzb5jbufczgzhn4
and anti-idiotypes. ... This peculiarity allows us to compare the partition function Z with a particular functor of topological field theory-the generating function of the Betti numbers of the state manifold of the system-which ... and the source are credited. ...doi:10.1007/s11047-014-9436-7 pmid:26300712 pmcid:PMC4541713 fatcat:bdnms2lnpref5iw4364krylyyy
Lecture Notes in Computer Science
Formal views of self-reproduction and time are surveyed, and a general asynchronization construction for automata networks is presented. ... Evolution and evolvability are distinguished, and the evolvability characteristics of natural and artificial examples are overviewed. ... Michod (discussions of individuality, sex, and fitness), John L. Rhodes (algebra and time), and Günter P. ...doi:10.1007/11571155_13 fatcat:4cdihrzr5reljbhedfxh67v47y
Results: We present Machine Boss, a software tool implementing not just inference and parameter-fitting algorithms, but also a set of operations for manipulating and combining automata. ... Availability and Implementation: Machine Boss is released under the BSD-3 open source license and is available from http://machineboss.org/. ... theory. ...doi:10.1101/2020.02.13.945071 fatcat:5jdoiter7jba3afn2keei467jm
The underlying mathematical language is that of PROPs and operads, and their representations. ... The sum over histories approach, the Feynman Legacy, is the bridge between quantum physics and quantum computing, pointing towards a deeper understanding of the fundamental concepts of space, time and ... Homology and cohomology of Feynman Categories To study a causal structure one needs to build and study Feynman Processes, i.e. the corresponding representation theory. ...arXiv:math/0701069v1 fatcat:4e3b3x4bzzdqjf6zrz7vnl5w6u
In this regard, we have used a popular GI algorithm Alergia to infer Deterministic Stochastic Finite State Automata (DSFA) which equally represents the regular grammar corresponding to the phosphorylation ... Characterizing the protein kinases and their substrates enhances our ability to understand the mechanism of protein phosphorylation and extends our knowledge of signaling network; thereby helping us to ... The authors like to thank Department of Biophysics, Molecular Biology and Bioinformatics for providing the computer facility. Author Contributions Conceived and designed the experiments: SD SM. ...doi:10.1371/journal.pone.0122294 pmid:25886273 pmcid:PMC4401752 fatcat:pnq6eti7orhold3y2wuztdprhu
Using this framework, the performance of FramePlus was found to be somewhat better than other algorithms in the presence of moderate and high rates of frameshift errors, and comparable to Translated Search ... Availability: The source code for FramePlus and the testing datasets are freely available at ftp.compugen.co. il/ pub/ research. Contact: email@example.com ... Acknowledgements We would like to thank Tim Hubbard for suggesting the method of algorithm comparison, and Ewan Birney and Hershel Safer for their advice. ...doi:10.1093/bioinformatics/15.11.867 pmid:10743553 fatcat:rs3ox57lmjbonk2e6sup2ag2uu
We develop some of the geometric intuition behind this theory and give some hints about the algebraic objects one can associate with it (in particular homology groups). ... For some historic as well as for some deeper reasons, the theory is at a stage where there is a nice blend between cubical, ω-categorical and topological techniques. ... theories) • Concerning the branching and confluence homologies, they are not sensitive to subdivision. ...doi:10.4310/hha.2003.v5.n2.a5 fatcat:jxdiy4dk5bchropv2vedojejau
« Previous Showing results 1 — 15 out of 291 results