Results 1  10
of
206
Linearspace computation of the editdistance between a string and a finite automaton
 In London Algorithmics 2008: Theory and Practice
, 2008
"... Abstract. The problem of computing the editdistance between a string and a finite automaton arises in a variety of applications in computational biology, text processing, and speech recognition. This paper presents linearspace algorithms for computing the editdistance between a string and an arbi ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
and an arbitrary weighted automaton over the tropical semiring, or an unambiguous weighted automaton over an arbitrary semiring. It also gives an efficient linearspace algorithm for finding an optimal alignment of a string and such a weighted automaton. 1
The Weighted Finite Automaton Inference Problem
, 1995
"... Weighted finite automata (WFA) were introduced as a device for generating and transforming pixel images. The inference problem is the determination of a WFA that generates a given image. There are two basic results in this paper. First, a general solution to the inference problem is given which alwa ..."
Abstract
 Add to MetaCart
Weighted finite automata (WFA) were introduced as a device for generating and transforming pixel images. The inference problem is the determination of a WFA that generates a given image. There are two basic results in this paper. First, a general solution to the inference problem is given which
MYHILLNERODE Congruence — Definition
"... A sequential transducer [3, 4] is a weighted automaton ¡£ ¢ ¡¥ ¤ ¡§¦¨¡� © ¡� � � such that for at most � one �, ..."
Abstract
 Add to MetaCart
A sequential transducer [3, 4] is a weighted automaton ¡£ ¢ ¡¥ ¤ ¡§¦¨¡� © ¡� � � such that for at most � one �,
MeanPayoff Automaton Expressions
"... Quantitative languages are an extension of boolean languages that assign to each word a real number. Meanpayoff automata are finite automata with numerical weights on transitions that assign to each infinite path the longrun average of the transition weights. When the mode of branching of the aut ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Quantitative languages are an extension of boolean languages that assign to each word a real number. Meanpayoff automata are finite automata with numerical weights on transitions that assign to each infinite path the longrun average of the transition weights. When the mode of branching
Optimal Paths in Weighted Timed Automata
 HSCC
, 2001
"... We consider an optimalreachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to a (parametric) shortestpath problem for a finite directed graph. The directed gr ..."
Abstract

Cited by 124 (5 self)
 Add to MetaCart
We consider an optimalreachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to a (parametric) shortestpath problem for a finite directed graph. The directed
The induction of dynamical recognizers
 Machine Learning
, 1991
"... A higher order recurrent neural network architecture learns to recognize and generate languages after being "trained " on categorized exemplars. Studying these networks from the perspective of dynamical systems yields two interesting discoveries: First, a longitudinal examination of the le ..."
Abstract

Cited by 225 (14 self)
 Add to MetaCart
of the learning process illustrates a new form of mechanical inference: Induction by phase transition. A small weight adjustment causes a "bifurcation" in the limit behavior of the network. This phase transition corresponds to the onset of the network’s capacity for generalizing to arbitrary
Coinductive Counting With Weighted Automata
, 2002
"... A general methodology is developed to compute the solution of a wide variety of basic counting problems in a uniform way: (1) the objects to be counted are enumerated by means of an infinite weighted automaton; (2) the automaton is reduced by means of the quantitative notion of stream bisimulation; ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
A general methodology is developed to compute the solution of a wide variety of basic counting problems in a uniform way: (1) the objects to be counted are enumerated by means of an infinite weighted automaton; (2) the automaton is reduced by means of the quantitative notion of stream bisimulation
Generalised Stochastic Automaton Image Compression
, 1997
"... It is well known that digital images can be generated by generalised stochastic automata (GSA). This fact has been taken as the basis for image compression by storing a GSA rather than the image that it generates. This paper investigates fundamental relationships between the parameters of GSA and th ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
and their generated images. In particular, we are interested in expressing the magnitude of GSA weights, and the precision to which they must be specified in image parameter terms. The significance of these relationships is connected to the compression ratio. An additional consequence of the use of GSA theory is a
Two Algorithms for Finding k Shortest Paths of a Weighted Pushdown Automaton
, 2014
"... Weighted pushdown automata (WPDAs) have recently been adopted in some applications such as machine translation [Iglesias et al., 2011] as a more compact alternative to weighted finitestate automata (WFSAs) for representing a weighted set of strings. Allauzen and Riley [2012] introduce a set of basi ..."
Abstract
 Add to MetaCart
Weighted pushdown automata (WPDAs) have recently been adopted in some applications such as machine translation [Iglesias et al., 2011] as a more compact alternative to weighted finitestate automata (WFSAs) for representing a weighted set of strings. Allauzen and Riley [2012] introduce a set
PathEquivalent Removals of εtransitions in a Genomic Weighted Finite Automaton
"... Abstract. Weighted finite automata (WFA) are used with accelerating hardware to scan large genomic banks. Hardwiring such automata raise surface area and clock frequency constraints, requiring efficient εtransitionsremoval techniques. In this paper, we present new bounds on the number of new trans ..."
Abstract
 Add to MetaCart
Abstract. Weighted finite automata (WFA) are used with accelerating hardware to scan large genomic banks. Hardwiring such automata raise surface area and clock frequency constraints, requiring efficient εtransitionsremoval techniques. In this paper, we present new bounds on the number of new
Results 1  10
of
206