A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Ultrametric Automata with One Head Versus Multihead Nondeterministic Automata
2015
Conference on Current Trends in Theory and Practice of Informatics
Preserved Fulltext
In this paper advantages of ultrametric automata with one head versus multihead deterministic and nondeterministic automata are observed. ...
In the last two years some advantages of ultrametric algorithms for finite automata and Turing machines were explored. ...
p-ultrametric finite automata with k heads. ...
dblp:conf/sofsem/DimitrijevsS15
fatcat:nwqjp7k5mbcljlchtq5pbcrajm
On the Hierarchy Classes of Finite Ultrametric Automata
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
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 application/pdf.
Ultrametric finite automata are similar to probabilistic and quantum automata and have only just recently been introduced by Freivalds. ...
This paper explores the language classes that arise with respect to the head count of a finite ultrametric automaton. ...
This paper examines whether similar results regarding the separation in classes with respect to the head count can be achieved for ultrametric multi-head finite automata. ...
doi:10.1007/978-3-662-46078-8_26
fatcat:g5p6gzmbivclpionfufwsbx3xq
Grids of Finite Automata
2016
Conference on Current Trends in Theory and Practice of Informatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Finite automata are a well known topic in computer science. Automata read words in a given alphabet and determine if those words belong to a specific formal language. ...
Parallelism in automata -systems consisting of multiple automata that read the same word -is far less researched. In this paper, a new model of parallel calculation with automata is introduced. ...
They could be simply non-deterministic, or probabilistic, or even ultrametric. We expect this to also be a significant factor in this model's computational power. ...
dblp:conf/sofsem/Jerins16
fatcat:vasvmdmqf5cwtddcimrrtg6xfa
Subject index volumes 1–200
1999
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
state asynchronous cellular automata. 2505
finite state automata, 227, 472
guaranteeing viability, 2625
state minimization of -, 786
with multiplicities, 227
finite state cellular automata, 2429 ...
synchronized -, 22 13
finite automata with
distance functions, 1353, 1513
multiplication, 40
finite automaton constructions. 3 123
finite behaviors. 616. ...
doi:10.1016/s0304-3975(98)00319-3
fatcat:s22ud3iiqjht7lfbtc3zctk7zm
Cellular automata over generalized Cayley graphs
2017
Mathematical Structures in Computer Science
Preserved Fulltext
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 application/pdf.
Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their relations; to name all vertices relative to an origin; and the fact that ...
We extend cellular automata theory to these arbitrary, bounded degree, time-varying graphs. The obtained notion of cellular automata is stable under composition and under inversion. ...
Acknowledgements This work has been funded by the ANR-10-JCJC-0208 CausaQ grant and by the John Templeton Foundation, grant ID 15619. ...
doi:10.1017/s0960129517000044
fatcat:rrsg6zukbverfjnxyqan2ekbdu
Generalized Cayley Graphs and Cellular Automata over them
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their relations; to name all vertices relative to a point; and the fact that they ...
The obtained notion of Cellular Automata over generalized Cayley graphs is stable under composition and under inversion. ...
Acknowledgements This work has been funded by the ANR-10-JCJC-0208 CausaQ grant and by the John Templeton Foundation, grant ID 15619. ...
arXiv:1212.0027v2
fatcat:wtvvetwabfgbpbjwrsewvexteu
Coalgebraic Behavioral Metrics
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We study different behavioral metrics, such as those arising from both branching and linear-time semantics, in a coalgebraic setting. ...
In order to model linear-time metrics (generalizing trace equivalences), we show sufficient conditions for lifting distributive laws and monads. ...
Acknowledgement The authors are grateful to Larry Moss, Franck van Breugel, Neil Ghani and Daniela Petrişan for several precious suggestions and inspiring discussions. ...
arXiv:1712.07511v3
fatcat:sfmjhfcbjrbl7khxoihvfcpduy
Some topics in the dynamics of group actions on rooted trees
2011
Proceedings of the Steklov Institute of Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
the combinatorics and asymptotic properties of Schreier graphs associated with a group or with its action. ...
The concepts of asymptotic expander and asymptotic Ramanujan graph are introduced, and examples of such graphs are given. ...
while I was preparing the paper, and for numerous valuable remarks on the preliminary versions of this text. ...
doi:10.1134/s0081543811040067
fatcat:ntspoyasofbcffubrj5cw33bdm
The Spectra of Lamplighter Groups and Cayley Machines
[article]
2005
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
We calculate the spectra and spectral measures associated to random walks on restricted wreath products of finite groups with the infinite cyclic group, by calculating the Kesten-von Neumann-Serre spectral ...
In the process we characterise when the usual spectral measure for a group generated by automata coincides with the Kesten-von Neumann-Serre spectral measure. ...
Automata groups and Cayley machines In this section, we introduce finite automata and the groups they generate. ...
arXiv:math/0412412v2
fatcat:5fplrn4sjzgrfilrqvegjgniim
Horocyclic products of trees
2008
Journal of the European Mathematical Society (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In the present paper, we explore the geometric, algebraic, analytic and probabilistic properties of these graphs and their isometry groups. ...
,q_d) is a vertex-transitive graph, but is not the Cayley graph of a finitely generated group. Indeed, it does not even admit a group action with finitely many orbits and finite point stabilizers. ...
Fruitful conversations with André Henriques and Christian Wüthrich are gratefully acknowledged. ...
doi:10.4171/jems/130
fatcat:sx6bf34hi5cgxmuqpmubrad6je
A Note on Strong Dinaturality, Initial Algebras and Uniform Parameterized Fixpoint Operators
2010
Fixed Points in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
FICS aims to provide a forum for researchers to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. ...
, the 7th Workshop on Fixed Points in Computer Science, was held in Brno, Czech Republic, on August 21-22 2010, as a satellite workshop to the conferences Mathematical Foundations of Computer Science and ...
Acknowledgments I thank Matthias Felleisen and Olivier Danvy for valuable exchanges, Eijiro Sumii, Makoto Tatsuta, Masahito Hasegawa, Yukiyoshi Kameyama and Yasuhiko Minamide for discussions. ...
dblp:conf/fics/Uustalu10
fatcat:ebz5fizidjajdhpbc6xj5lzfzu
Connections of coalgebra and semantic modeling
2011
Proceedings of hte 13th Conference on Theoretical Aspects of Rationality and Knowledge - TARK XIII
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Coalgebra is a general study of a great many kinds of models, and these include type spaces and Kripke models, and many others. ...
It is also intended to bring together literatures from theoretical computer science and game theory. ...
Similarly, den Hartog and de Vink [HV] study complete ultrametric spaces and non-expanding maps. ...
doi:10.1145/2000378.2000382
dblp:conf/tark/Moss11
fatcat:2a2b5nwcmneyxewpp6giulygsi
Bioinformatics---an introduction for computer scientists
2004
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
The underlying motivation for many of the bioinformatics approaches is the evolution of organisms and the complexity of working with incomplete and noisy data. ...
and functional genomics. ...
ACKNOWLEDGMENTS The author wishes to express his gratitude to Mark Gerstein, Nathan Goodman and the reviewers who provided many suggestions to improve the original manuscript. ...
doi:10.1145/1031120.1031122
fatcat:i5au72xpujffrgryx3vnyiyeyy
Page 1123 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Behaviour, reduction and minimization of finite L-automata. 89m:68106
Podkolzin, A. S. (with Ush-chumlich, Sh. M.) ...
(English summary) [Transcendental generating functions with coefficients generated by automata] 89c:68079
Barashko, A.S. The statistical equivalence of automata with respect to input and output. ...
Subject Index to Volumes 1–75
2001
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
4089
maps, 307
model, 142
simulation of
2DPDA, 547
2dpda(k), 909
2npda(k), 814
circuits, 1986
large networks, 1651
one-way two-head nondeterministic finite
automata, 1065
PRAMs with scan primitives ...
, 3847
space and reversal bounded deterministic Turing
machines, 1379
two-head finite automata, 1640
simulation
relation, 2210 single machine
failure, 2084
problems, 1180
single machine scheduling ...
pair of functions, 1682 unicyclic graph, 492, 505 unidirectional, 1980 , 3563 dynamic MOS shift register, 264 links, 2868 loop, 2168 messages, 1831 unidirectional ring, 1607 , 1712 , 2009 of identical finite ...
doi:10.1016/s0020-0190(01)00175-2
fatcat:5y67tfm6yfbblakrus5nnhs73e
« Previous
Showing results 1 — 15 out of 22 results