3818 search results - page 58 / 764 » Word Problems on Compressed Words |
138
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
166
click to vote
TIT
2008
15 years 4 months ago
2008
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
139
click to vote
ACL
1996
15 years 5 months ago
1996
This paper discusses the problem of learning language from unprocessed text and speech signals, concentrating on the problem of learning a lexicon. In particular, it argues for a ...
118
click to vote
LICS
2005
IEEE
15 years 10 months ago
2005
IEEE
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words...
213
click to vote
CSLP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This article describes an attempt to implement a constraintbased dependency grammar for Czech, a language with rich morphology and free word order, in the formalism Exten...