562 search results - page 44 / 113 » Concurrent Turing Machines |
129
Voted
ISSTA
2004
ACM
15 years 9 months ago
2004
ACM
Software process and workflow languages are increasingly used to define loosely-coupled systems of systems. These languages focus on coordination issues such as data flow and c...
135
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
132
Voted
ICCAD
2000
IEEE
15 years 8 months ago
2000
IEEE
Most hardware description frameworks, whether schematic or textual, use cooperating finite state machines (CFSM) as the underlying abstraction. In the CFSM framework, a designer ...
127
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
142
Voted
FSEN
2009
Springer
15 years 10 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...