1701 search results - page 36 / 341 » Computer Science and State Machines |
FECS
2007
14 years 11 months ago
2007
Computing professionals are employed in so many different ways that it is difficult to even define the common foundation that all of them should master; however, a single degree ...
EUROGP
2003
Springer
15 years 3 months ago
2003
Springer
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
CONCUR
2000
Springer
15 years 1 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
CHI
2011
ACM
14 years 1 months ago
2011
ACM
Citizen science projects can collect a wealth of scientific data, but that data is only helpful if it is actually used. While previous citizen science research has mostly focused ...