759 search results - page 16 / 152 » Odometers on Regular Languages |
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
IFIP
2004
Springer
14 years 23 days ago
2004
Springer
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and to...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
