7311 search results - page 116 / 1463 » Time in State Machines |
135
Voted
COCO
2000
Springer
15 years 7 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
130
Voted
NIPS
2004
15 years 5 months ago
2004
An analog system-on-chip for kernel-based pattern classification and sequence estimation is presented. State transition probabilities conditioned on input data are generated by an...
139
Voted
CATS
2006
15 years 5 months ago
2006
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
116
click to vote
DATE
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper describes the results of a new synthesis tool (XBM2PLA) for asynchronous state machines [2]. XBM2PLA generates the boolean functions for an asynchronous circuit. XBM2PL...
156
click to vote
SOFSEM
2012
Springer
13 years 11 months ago
2012
Springer
Abstract. Various methods exists in the literature for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer ...