4934 search results - page 58 / 987 » complexity 2008 |
123
click to vote
COGSCI
2004
15 years 3 months ago
2004
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...
130
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
121
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
As the need for advanced, interactive mathematical models has increased, user/programmers are increasingly choosing the MatLab
117
click to vote
MCS
2008
Springer
15 years 3 months ago
2008
Springer
Biochemistry in general and enzyme kinetics in particular have been heavily influenced by the model of biochemical reactions known as Michaelis
104
Voted
DLT
2008
15 years 5 months ago
2008
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...