429 search results - page 39 / 86 » Noisy Turing Machines |
FSEN
2009
Springer
15 years 4 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...
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
In higher-order process calculi the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators nec...
CIE
2005
Springer
15 years 3 months ago
2005
Springer
We argue that there is currently no satisfactory general framework for comparing the extensional computational power of arbitrary computational models operating over arbitrary doma...
SIGCSE
2004
ACM
15 years 3 months ago
2004
ACM
We describe the instructional software JFLAP 4.0 and how it can be used to provide a hands-on formal languages and automata theory course. JFLAP 4.0 doubles the number of chapters...
ATAL
2004
Springer
15 years 3 months ago
2004
Springer
The ‘engineering’ and ‘adaptive’ approaches to system production are distinguished. It is argued that producing reliable self-organised software systems (SOSS) will necessa...