Sciweavers

303 search results - page 40 / 61
» Automata on Gauss Words
Sort
View
CSL
2007
Springer
13 years 9 months ago
Discriminative n-gram language modeling
This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a...
Brian Roark, Murat Saraclar, Michael Collins
CORR
2000
Springer
133views Education» more  CORR 2000»
13 years 9 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
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...
Pei-Chi Wu
MFCS
2010
Springer
13 years 8 months ago
Properties of Visibly Pushdown Transducers
Abstract. Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automa...
Emmanuel Filiot, Jean-François Raskin, Pier...
FM
2009
Springer
163views Formal Methods» more  FM 2009»
14 years 2 months ago
Analysis of a Clock Synchronization Protocol for Wireless Sensor Networks
We study a clock synchronization protocol for the Chess WSN. First, we model the protocol as a network of timed automata and verify various instances using the Uppaal model checker...
Faranak Heidarian, Julien Schmaltz, Frits W. Vaand...
ENTCS
2006
231views more  ENTCS 2006»
13 years 9 months ago
SaveCCM: An Analysable Component Model for Real-Time Systems
Component based development is a promising approach for embedded systems. Typical for embedded software is the presence of resource constraints in multiple dimensions. An essentia...
Jan Carlson, John Håkansson, Paul Pettersson