Sciweavers

6829 search results - page 45 / 1366
» Quantitative Generalizations of Languages
Sort
View
POPL
2007
ACM
16 years 1 months ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...
85
Voted
FSTTCS
2010
Springer
14 years 10 months ago
Two Size Measures for Timed Languages
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...
Eugene Asarin, Aldric Degorre
98
Voted
ICALP
2007
Springer
15 years 4 months ago
A Generalization of Cobham's Theorem to Automata over Real Numbers
Abstract. This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in th...
Bernard Boigelot, Julien Brusten
107
Voted
JCSS
2011
81views more  JCSS 2011»
14 years 7 months ago
Representing real numbers in a generalized numeration system
Abstract. We show how to represent an interval of real numbers in an abstract numeration system built on a language that is not necessarily regular. As an application, we consider ...
Emilie Charlier, Marion Le Gonidec, Michel Rigo
112
Voted
FMCO
2004
Springer
112views Formal Methods» more  FMCO 2004»
15 years 6 months ago
Probabilistic Linda-Based Coordination Languages
Abstract. Coordination languages are intended to simplify the development of complex software systems by separating the coordination aspects of an application from its computation ...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...