Sciweavers

1701 search results - page 5 / 341
» Computer Science and State Machines
Sort
View
DAC
1996
ACM
15 years 7 months ago
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
Hiroyuki Higuchi, Yusuke Matsunaga
SOFSEM
2012
Springer
13 years 11 months ago
Turing Machines for Dummies - Why Representations Do Matter
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 ...
Peter van Emde Boas