Sciweavers

24 search results - page 2 / 5
» On the Power of Quantum Finite State Automata
Sort
View
78
Voted
ICCS
2004
Springer
15 years 3 months ago
Evolutionary State Assignment for Synchronous Finite State Machines
: Synchronous finite state machines are very important for digital sequential designs. Among other important aspects, they represent a powerful way for synchronizing hardware comp...
Nadia Nedjah, Luiza de Macedo Mourelle
53
Voted
SIAMCOMP
1998
99views more  SIAMCOMP 1998»
14 years 10 months ago
On the Power of Finite Automata with Both Nondeterministic and Probabilistic States
Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi ...
AAAI
2010
14 years 11 months ago
Finite-State Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs
Existing controller-based approaches for centralized and decentralized POMDPs are based on automata with output known as Moore machines. In this paper, we show that several advant...
Christopher Amato, Blai Bonet, Shlomo Zilberstein
76
Voted
DLT
2009
14 years 8 months ago
On Stateless Multihead Finite Automata and Multihead Pushdown Automata
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currentl...
Pierluigi Frisco, Oscar H. Ibarra
CORR
2011
Springer
193views Education» more  CORR 2011»
14 years 5 months ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker