3653 search results - page 19 / 731 » On Recognizable Timed Languages |
HYBRID
2003
Springer
15 years 2 months ago
2003
Springer
The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable inter...
ICFP
2001
ACM
15 years 9 months ago
2001
ACM
107
click to vote
DSRT
2008
IEEE
14 years 11 months ago
2008
IEEE
Most common real-time embedded programming languages provide a means to specify functionality; however, they have few constructs to specify precise timing constraints. LabVIEW is ...
WWW
2011
ACM
14 years 4 months ago
2011
ACM
This paper uses the URL word breaking task as an example to elaborate what we identify as crucialin designingstatistical natural language processing (NLP) algorithmsfor Web scale ...
93
Voted
SFP
2003
14 years 11 months ago
2003
Abstract This paper explores the suitability of functional languages for programming real-time systems. We study the requirements of real-time systems in general, outline typical l...