759 search results - page 14 / 152 » Odometers on Regular 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...
121
click to vote
FOSSACS
2001
Springer
15 years 2 months 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 ...
IPL
2007
14 years 9 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
We demonstrate that regularization can improve feedback in a language modeling framework. Categories and Subject Descriptors: H.3.3 Information Search and Retrieval: Relevance Fee...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of ...