495 search results - page 49 / 99 » Automata and differentiable words |
ICALP
2001
Springer
14 years 9 days ago
2001
Springer
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state ma...
FOSSACS
2006
Springer
13 years 11 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
CSL
2007
Springer
13 years 7 months ago
2007
Springer
This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
CSDA
2006
13 years 7 months ago
2006
Fitting of non-Gaussian hierarchical random effects models by approximate maximum likelihood can be made automatic to the same extent that Bayesian model fitting can be automated ...