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.
Filters
Tree Automata and Discrete Distributed Games
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
Distributed games, as defined in [6] , is a recent multiplayer extension of discrete two player infinite games. ...
More precisely, we use alternating tree automata composition, and simulation of an alternating automaton by a non-deterministic one, as two central tools for giving a simple proof of known decidable cases ...
Tree Automata and Distributed Games We first mix games and automata, defining a winning condition by means of a tree-automaton that recognizes the set of trees of winning strategies. ...
doi:10.1007/11537311_47
fatcat:hor5zf7cebh5lnuhdcpefxdchq
Cumulative subject index volumes 33–35
1977
Information and Control
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.
two random processes, 33, 273
Model theoretic games
use in discrete linear orders and finite
automata, 33, 281
l~Ionoid
flee, disjunctive languages on, 34, 123
Multiplicative noise
linear filtering ...
observability
and
controllability,
for
nonlinear
distributed parameter systems, 34, 348
Submonoids
free: intersections, recognition, 35, 173
Tessellation automata
multidimensional, completeness ...
doi:10.1016/s0019-9958(77)90187-5
fatcat:jaxd23nbmva5hdnq37lof736um
Page 3836 of Mathematical Reviews Vol. , Issue 81I
[page]
1981
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.
This paper highlights some curious properties of such trees when h is very large and examines their implications on the complexity of various game-searching methods. ...
Specific models of the en- vironment and of the automata are formulated. ...
Stochastic optimization over continuous and discrete variables with applications to concept learning under noise
1999
IEEE transactions on systems, man and cybernetics. Part A. Systems and humans
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.
We propose a stochastic learning algorithm based on the model of a hybrid team of learning automata involved in a stochastic game with incomplete information to solve this optimization problem and establish ...
We consider optimization problems where the objective function is defined over some continuous and some discrete variables, and only noise corrupted values of the objective function are observable. ...
In the theory of learning automata, algorithms for learning optimal strategies have been developed for many discrete and continuous games [2] , [10] - [12] and have been used for adaptive decision ...
doi:10.1109/3468.798058
fatcat:54mbvtqrsrhiflv4ezhvw45n3y
Page 4721 of Mathematical Reviews Vol. , Issue 84k
[page]
1984
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.
N.(2-TBIL)
The rate of establishment of a stationary distribution in a
two-dimensional game of 7» identical automata. (Russian. English
and Georgian summaries)
Soobshch. Akad. Nauk Gruzin. ...
The class of isomorphs of automata SI(A) is characterized by internal structure, as was done for the class of
84k:68040
68E Discrete mathematics
84k:-O8 044
isomorphs of monoid automata. ...
Page 3706 of Mathematical Reviews Vol. , Issue 90F
[page]
1990
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.
The paper analyzes the difficulty of the following questions re- garding best-response automata in the theory of repeated games: (1) BRA,: Given a game G with n players and n finite automata for the players ...
They consist of a tree, where the terminal positions are assigned the values of independent, iden- tically distributed random variables with a finite range of values. ...
Search of Complex Binary Cellular Automata Using Behavioral Metrics
[article]
2015
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 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We use these measures to characterize a cellular automaton and guide a genetic search algorithm, which selects cellular automata similar to the Game of Life. ...
Behaviors characterized through these metrics are growth, decrease, chaoticity, and stability. ...
We appreciate the support of the Physics and Mathematics in Biomedicine Consortium. We also wish to thank Todd Rowland for his encouragement and continued interest in the project ...
arXiv:1412.2287v3
fatcat:auhg2lztjfeatnj26d4g46hmw4
Cumulative subject index
1990
Information and Computation
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.
Algebras and first-order logic for complexity class NC, 87, 241 process, associated priorities, 87, 58 Algorithms Arimoto-Blahut, in calculating capacity of continuous-input discrete-output memoryless ...
207 Automata finite, nondeterminism in, measurement, 86, 179 nonuniform, over groups, 89, 109 B Bisimulation in behavioral preorders, and divergence in communicating systems, analysis, 85, 202 ' Boldface ...
other related term tion classes, 86, 195 complete, for monoid of tree transforma-in regular languages, measurement, 86, 179 Rewriting systems Nondeterminism 85, 183 Networks distributed, symmetry breaking ...
doi:10.1016/0890-5401(90)90012-7
fatcat:abh2kjcxfveulfizk3aa5ifc64
Page 4199 of Mathematical Reviews Vol. , Issue 99f
[page]
1999
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.
Yamamoto, Optimal broad- casting in almost trees and partial k-trees (432-443); Thomas Schwentick and Klaus Barthelmann, Local normal forms for first- order logic with applications to games and automata ...
Larsen, Partially persistent search trees with transcript operations (309-319); Damian Niwinski and Igor Walukiewicz, Relating hier- archies of word and tree automata (320-331); Howard Straubing, Languages ...
Terrain Generation From User Text using Cellular Automata
2019
International journal of recent technology and engineering
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.
Incorporating the user's preferences and creativity in the games is still a challenging task. In this paper, we focus on the diversity of terrain generation in terms of its components. ...
The end result is to provide a user skill-matched terrain, which can be rendered for various games. ...
If we are considering a forest TDA will have to determine the density of trees based on the forest, the distribution of height among the trees, age distribution etc. ...
doi:10.35940/ijrte.c6425.098319
fatcat:4zrduhmbrjbopkvwwan25z4r5e
Page 4057 of Mathematical Reviews Vol. , Issue 89G
[page]
1989
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.
The paper introduces an interesting model of alternating automata which provides a new approach in the study of tree automata and logical theories over infinite trees. ...
Martin’s result on determinacy of Borel games [Ann. of Math. (2) 102 (1975), no. 2, 363-371; MR 53 #7785], it is shown that for any tree ¢, the alternating automaton M does not accept ¢ if and only if ...
The Complexity of Enriched Mu-Calculi
2008
Logical Methods 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.
Other Versions
The automata models we introduce are two-way graded alternating parity automata over infinite trees (2GAPTs) and fully enriched automata (FEAs) over infinite forests. ...
Our results are obtained by introducing two new automata models, showing that their emptiness problems are ExpTime-complete, and then reducing satisfiability in the relevant logics to these problems. ...
In this paper, we aim to study model-checking algorithms for probabilistic timed automata [13, 15] , a variant of timed automata extended with discrete probability distributions, or (equivalently) Markov ...
doi:10.2168/lmcs-4(3:11)2008
fatcat:srhwqbi7z5baloboe2hjtvwhmy
Simulation of Life Game Based on Cellular Automata
2021
Journal of Computer and Communications
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 2021; you can also visit the original URL.
The file type is application/pdf.
The entire system is completely closed and has certain limitations. Meanwhile, the evolution process of symmetrical initial state is also symmetrically distributed. ...
According to cell forms such as circulation and disappearance, it reflects the complex changes of Game of Life. ...
However, it is also the charm of cellular automata, namely unpredictable, unmeasurable and unpredictable. A seed can grow into a big tree in various forms or even an oasis. ...
doi:10.4236/jcc.2021.91005
fatcat:tpzyuoaqj5dbxlrhieunn7j5lm
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.
, 728
reductions in -, 728
tree representation, 2735, 3423
for distributive and simplicial lattices, 3173
of graphs. 3423
tree representation scheme, 741
k-ary -, 74 1
tree
rewriting system, 728 ...
WWWWW, 2077
Wyllie, Fortune, Hopcroft and -, 752
Wythoff games, 577
in miskre play, 577
Wythoff s game, 1418
WZ proof, 2253
X
X complexity of L, 299
X-automata, 2134
X-interpretations,
88 ...
doi:10.1016/s0304-3975(98)00319-3
fatcat:s22ud3iiqjht7lfbtc3zctk7zm
Page 9249 of Mathematical Reviews Vol. , Issue 2002M
[page]
2002
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.
Ladner, Thresholds and optimal binary comparison search trees (extended abstract) (83-95); Lubo$’ Brim, Ivana Cerna, Pavel Kréal and Radek Pelanek, Distributed LTL model checking based on nega-
68 COMPUTER ...
and ecology of rock-paper- scissors game (384-395). ...
« Previous
Showing results 1 — 15 out of 3,687 results