「Automaton」の共起表現一覧(1語右で並び替え)
該当件数 : 120件
| ould be simulated by a second order cellular | automaton, a different type of cellular automaton inve |
| In a cellular | automaton, a finite pattern is called a sawtooth if it |
| In a cellular | automaton, a gun is a pattern of which the main part r |
| Informally, a tree walking | automaton A (TWA) is a finite state device which walks |
| raph properties of a nondeterministic finite | automaton A with state set Q, we naturally address the |
| tes in the case of a nondeterministic finite | automaton) a finite semiautomaton or finite state mach |
| finds himself in the possession of a strange | automaton able to take photographs. |
| The minimal | automaton accepting our language would have three stat |
| dable whether a given deterministic pushdown | automaton accepts a regular language. |
| He is known for inventing the block cellular | automaton and the Margolus neighborhood for block cell |
| can determinize the given non-deterministic | automaton and then, for each instant of above query, o |
| Mount Shasta, Arab On Radar, Yowie, Athletic | Automaton, and PRE. |
| All three types of patterns formed by this | automaton are visible in this image. |
| lphabet from which the input strings for the | automaton are built. |
| ater revealed that this "machine" was not an | automaton at all, but was in fact a chess master hidde |
| f states in the minimum deterministic finite | automaton Aβ* to recognize language β*. |
| rs of the two-dimensional Life-like cellular | automaton B36/S125, also called "2x2", and the behavio |
| chi squared test compared to other cellular | automaton based generators. |
| Automaton Biographies (2009) Arsenal Pulp Press | |
| a game he lost to the supposed chess-playing | automaton, called The Turk. |
| atics, notably the invention of the cellular | automaton called the Game of Life. |
| grammars are those a deterministic pushdown | automaton can recognize. |
| F. Similarly every Rabin, Streett or parity | automaton can also be regarded as a Muller automaton. |
| A continuous | automaton can be described as a cellular automaton ext |
| The | automaton can use the symbol A to count the number of |
| Besides ordinary actions, an | automaton can put a pebble at a currently visited node |
| -boy figures strike the quarter hours on the | Automaton clock. |
| For a different notion of tree | automaton, closely related to regular tree languages, |
| Byl's | automaton consisted of an array of 12 chips - of which |
| The behavior of a hybrid | automaton consists of discrete state transitions and c |
| A finite-state | automaton distinguishes a special "start" state and a |
| that of Professor Tope (a mole), pioneer of | automaton engineering. |
| going to use the lemma to construct a Muller | automaton for language αβω. |
| lgorithm to construct a deterministic finite | automaton from a given nondeterministic finite automat |
| ces for one web service using a finite state | automaton FSA over the alphabet of message types. |
| John Byl simplified Langton's | automaton further, with an even smaller automaton that |
| imation of two dimensional cyclical cellular | automaton growing to repeating patterns from a random |
| rongly, every non-locally-injective cellular | automaton has an orphan pattern. |
| Without this restriction, the | automaton has undecidable emptiness and expressive pow |
| In other words, it states that a cellular | automaton has a Garden of Eden, if and only if it has |
| The resulting second order | automaton, however, will generally bear little resembl |
| ition function of a one-dimensional cellular | automaton if and only if it is continuous (with respec |
| Whether the | automaton in question is a finite state machine, a pus |
| octahedral neighborhood for a cubic cellular | automaton in three dimensions. |
| hod for decomposing a (deterministic) finite | automaton into "simple" components that are themselves |
| Such an | automaton is called tree automaton. |
| In automata theory, an alternating tree | automaton is an extension of nondeterministic tree aut |
| An aperiodic finite-state | automaton is a finite-state automaton whose transition |
| The cyclic cellular | automaton is a cellular automaton rule developed by Da |
| is useful to model implementations of hybrid | automaton is the lazy linear hybrid automaton. |
| A pebble | automaton is a tree walking automaton with an addition |
| In automata theory, a nested stack | automaton is a finite automaton that can make use of a |
| ultiple arrows for an input character if the | automaton is an NFA. |
| Informally, a hybrid | automaton is a (possibly infinite) state machine augme |
| A nested stack | automaton is capable of recognizing an indexed languag |
| In computer science, a pebble | automaton is an extension of tree walking automata whi |
| d a proof showing that the Rule 110 cellular | automaton is Turing-complete. |
| ta theory, determinizing a non-deterministic | automaton is a very important procedure. |
| state hashing, where each state (e.g. of an | automaton) is represented by a number and it is passed |
| is invertible, it follows that the resulting | automaton is reversible, regardless of how the functio |
| n several flavors: The Alur-Henzinger hybrid | automaton is a popular model; it was developed primari |
| the length of the input, the linear bounded | automaton is computationally equivalent to a nondeterm |
| A common deterministic | automaton is a deterministic finite state machine (som |
| Deterministic | automaton is a concept of automata theory in which the |
| A second order cellular | automaton is a type of reversible cellular automaton ( |
| ough the detailed evolution of this cellular | automaton is very different from Conway's Game of Life |
| It is a version of the zero-player cellular | automaton known as Conway's Game of Life. |
| It is said that the | automaton makes one copy of itself for each successor |
| Turriano is attributed as the creator of an | automaton manufactured in the 1560s based on a commiss |
| A nested stack | automaton may read its stack, in addition to pushing o |
| Such an | automaton may be defined as a 5-tuple (Q, Σ, T, q0, F) |
| player operating the remote-controlled chess | automaton Mephisto, but later became a chess professio |
| The Hybrid Input/Output | Automaton model has been developed more recently. |
| Cellular | automaton models have been proposed for bidirectional |
| iate corollary is that an injective cellular | automaton must be surjective. |
| Since a finite state | automaton must eventually return to a previously visit |
| This procedure accepts a non-deterministic | automaton of some type and returns another determinist |
| Turk comes from "The Turk," a chess-playing | automaton of the 18th century, which was made by Wolfg |
| m bits, as a quantum version of the cellular | automaton of von Neumann. |
| the set can be determined by a finite state | automaton on the digits of n in base k. |
| , Spalanzani, who is later revealed to be an | automaton, or robot; this revelation is one of the ele |
| In this case after reading each symbol, the | automaton reads all the successor symbols in the input |
| esult by relaxing the criterion by which the | automaton recognizes a majority. |
| Day & Night is a cellular | automaton rule in the same family as Game of Life. |
| ation into the different elementary cellular | automaton Rule 22 by replacing each Rule 90 cell by th |
| This article is about a cellular | automaton rule. |
| n Conway's Game of Life and similar cellular | automaton rules, a spark is a small collection of live |
| n the notation describing Life-like cellular | automaton rules, it is rule B3/S012345678: a live cell |
| An aperiodic | automaton satisfies the Cerny conjecture. |
| ansformation, every six steps of the Rule 22 | automaton simulates a single step of the Rule 90 autom |
| Computer game software that has cellular | automaton simulation as its primary purpose should, ho |
| ffoli, Margolus developed the CAM-6 cellular | automaton simulation hardware, which he extensively de |
| he series were characterised by a caged bird | automaton singing over the programme's opening and clo |
| ida and was published in 2005 as Automaton² ( | Automaton Squared) followed by "Binfen 2005 Remix", "E |
| Fantasio follow it to Champignac, where the | automaton stops in an old unused railway station. |
| involve finding the right construction of an | automaton such that the problem can be answered. |
| easuring the computational power of cellular | automaton systems. |
| A girl | Automaton that serves under Aberdeen. |
| Infinite input: An | automaton that accepts infinite words (ω-words). |
| It is a tabular representation of a pushdown | automaton that is generated from the context-free gram |
| to the construction such that there exist no | automaton that satisfy the desired property with small |
| majority problem, of constructing a cellular | automaton that can determine whether an initial config |
| it is accepted by a given non-deterministic | automaton then one have to check every possible run of |
| on is that if one starts with such a minimal | automaton, then any strings x and y that drive it to t |
| itled "Risk Compensation versus the obedient | automaton theory of human behaviour" he discussed how |
| of logical organization is necessary for an | automaton to be able to reproduce itself? |
| In order for the cellular | automaton to implement the cyclic tag system, the auto |
| Christopher Langton extended Codd's cellular | automaton to create Langton's loops, which also exhibi |
| traffic model is a self-organizing cellular | automaton traffic flow model. |
| uence is a mapping of the final state of the | automaton when its input is the digits of n in some fi |
| mulates the one-dimensional Rule 90 cellular | automaton, where a single replicator simulates a nonze |
| ars after Langton's simplification of Codd's | automaton, which produced a simpler automaton (shown b |
| The proposed | automaton will accept a word iff a time i exists such |
| tar-free if and only if it is accepted by an | automaton with a finite and aperiodic transition monoi |
| n automata theory, a nondeterministic finite | automaton with ε-moves (ε-NFA) is defined as a 5-tuple |
| property as input and produces as output an | automaton with the property. |
| ique used to demonstrate the existence of an | automaton with a certain desired property. |
| It is a two-dimensional, 5-neighbor cellular | automaton with 6 states per cell, and was developed in |
| on has any unmatched parentheses, whereas an | automaton with no stack would require an infinite numb |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
