432 search results - page 5 / 87 » On Notions of Regularity for Data Languages |
FMSD
2007
13 years 7 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...
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
FOSSACS
2001
Springer
14 years 1 days ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
COLING
2000
13 years 9 months ago
2000
Results presented in this paper strongly support the notion that similarities as well as differences in language systems can be empirically investigated by looking into the lingui...
FOSSACS
2004
Springer
14 years 28 days ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...