3653 search results - page 172 / 731 » On Recognizable Timed Languages |
157
Voted
ECAI
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. User generated content in general, and blogs in particular, form an interesting and relatively little explored domain for mining knowledge. We address the task of blog di...
138
click to vote
CORR
2000
Springer
15 years 5 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
166
click to vote
ICFP
1999
ACM
15 years 9 months ago
1999
ACM
The MrEd virtual machine serves both as the implementation platform for the DrScheme programming environment, and as the underlying Scheme engine for executing expressions and pro...
109
click to vote
STOC
1987
ACM
15 years 8 months ago
1987
ACM
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
COLING
2008
15 years 6 months ago
2008
It is shown how weighted context-free grammars can be used to recognize languages beyond their weak generative capacity by a one-step constant time extension of standard recogniti...