3653 search results - page 21 / 731 » On Recognizable Timed Languages |
FMSD
2007
14 years 9 months ago
2007
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
Quantitative properties of timed regular languages, such as information content (growth rate, entropy) are explored. The approach suggested by the same authors is extended to lang...
EPIA
1989
Springer
15 years 1 months ago
1989
Springer
In this paper a model for temporal references in natural language (NL) is studied and a Prolog implementation of it is presented. This model is intended to be a common framework f...
SCP
1998
14 years 9 months ago
1998
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...
IWPSE
2005
IEEE
15 years 3 months ago
2005
IEEE
Humans will have to live with software for a long time. As demonstrated by the Y2K problem, computer professionals used a wrong time scale when thinking about software. Large soft...