35 search results - page 2 / 7 » Computation of distances for regular and context-free probab... |
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
RSCTC
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
MFCS
1998
Springer
13 years 9 months ago
1998
Springer
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...
ICML
2005
IEEE
14 years 5 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...