Sciweavers

759 search results - page 6 / 152
» Overlap-Free Regular Languages
Sort
View
MST
2007
132views more  MST 2007»
13 years 8 months ago
Odometers on Regular Languages
Odometers or “adding machines” are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this no...
Valérie Berthé, Michel Rigo
MST
2007
97views more  MST 2007»
13 years 8 months ago
Distribution of Additive Functions with Respect to Numeration Systems on Regular Languages
Abstract. We study the distribution of values of additive functions related to numeration systems defined via regular languages.
Peter J. Grabner, Michel Rigo
TCS
2008
13 years 7 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta
PLDI
2009
ACM
14 years 9 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
FOSSACS
2001
Springer
14 years 28 days ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin