1052 search results - page 173 / 211 » The Regular Real-Time Languages |
128
click to vote
DM
2010
15 years 3 months ago
2010
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...
151
click to vote
ALIFE
2006
15 years 3 months ago
2006
We show how cultural selection for learnability during the process of linguistic evolution can be visualized using a simple iterated learning model. Computational models of linguis...
139
Voted
FMSD
2008
15 years 3 months ago
2008
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
118
click to vote
ITA
2006
15 years 3 months ago
2006
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...
124
click to vote
AI
2002
Springer
15 years 3 months ago
2002
Springer
Abstract In this paper, we describe our Question Answering (QA) system called QUANTUM. The goal of QUANTUM is to find the answer to a natural language question in a large document ...