429 search results - page 17 / 86 » Noisy Turing Machines |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
ANNALS
2010
13 years 4 months ago
2010
The increasing popularity in the late 1970s of affordable, general-purpose, microprocessor-based personal computers in the US, generated a widespread interest around the world in t...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
COLING
2010
13 years 2 months ago
2010
In this paper we look at the problem of cleansing noisy text using a statistical machine translation model. Noisy text is produced in informal communications such as Short Message...
UC
2009
Springer
14 years 1 months ago
2009
Springer
The paper surveys the fundamental principles of evolvable hardware, introduces main problems of the field and briefly describes the most successful applications. Although evolvab...