Sciweavers

1728 search results - page 17 / 346
» The Size of Power Automata
Sort
View
ITNG
2007
IEEE
14 years 2 months ago
Computational Power of the Quantum Turing Automata
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuh...
CONCUR
2009
Springer
14 years 3 months ago
Power of Randomization in Automata on Infinite Strings
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
FSTTCS
1998
Springer
14 years 21 days ago
The Power of Reachability Testing for Timed Automata
Luca Aceto, Patricia Bouyer, Augusto Burgueñ...
CORR
2004
Springer
139views Education» more  CORR 2004»
13 years 8 months ago
The Computational Power of Benenson Automata
The development of autonomous molecular computers capable of making independent decisions in vivo regarding local drug administration may revolutionize medical science. Recently B...
David Soloveichik, Erik Winfree