Results 1  10
of
150
Minimization of Sequential Transducers
 Lecture Notes in Computer Science
"... . We present an algorithm for minimizing sequential transducers. This algorithm is shown to be efficient, since in the case of acyclic transducers it operates in O(jEj + jV j + (Ej \Gamma jV j + jF j):(jPmax j + 1) steps, where E is the set of edges of the given transducer, V the set of its vertices ..."
Abstract

Cited by 25 (8 self)
 Add to MetaCart
. We present an algorithm for minimizing sequential transducers. This algorithm is shown to be efficient, since in the case of acyclic transducers it operates in O(jEj + jV j + (Ej \Gamma jV j + jF j):(jPmax j + 1) steps, where E is the set of edges of the given transducer, V the set of its
Minimization Algorithms for Sequential Transducers
, 2000
"... We present general algorithms for minimizing sequential finitestate transducers that output strings or numbers. The algorithms are shown to be efficient since in the case of acyclic transducers and for output strings they operate in O(S+E+V+(EV+F)x(Pmax+1)) steps, where S is the sum of ..."
Abstract

Cited by 64 (11 self)
 Add to MetaCart
We present general algorithms for minimizing sequential finitestate transducers that output strings or numbers. The algorithms are shown to be efficient since in the case of acyclic transducers and for output strings they operate in O(S+E+V+(EV+F)x(Pmax+1)) steps, where S is the sum
Multiset Processing by means of Systems of Sequential Transducers
, 1999
"... We introduce a computing mechanism of a biochemical inspiration (similar to a P system in the area of computing by membranes) which consists of a multiset of symbolobjects and a set of finite state sequential transducers. The transducers process symbols in the current multiset in the usual manner. ..."
Abstract
 Add to MetaCart
We introduce a computing mechanism of a biochemical inspiration (similar to a P system in the area of computing by membranes) which consists of a multiset of symbolobjects and a set of finite state sequential transducers. The transducers process symbols in the current multiset in the usual manner
The Suffix Tree of a Tree and Minimizing Sequential Transducers
, 1995
"... This paper gives a lineartime algorithm for the construction of the suffix tree of a tree. The suffix tree of a tree is used to obtain an efficient algorithm for the minimization of sequential transducers. 1 Introduction The suffix tree of a string is a compact trie representing all suffixes of ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
This paper gives a lineartime algorithm for the construction of the suffix tree of a tree. The suffix tree of a tree is used to obtain an efficient algorithm for the minimization of sequential transducers. 1 Introduction The suffix tree of a string is a compact trie representing all suffixes
Incremental Construction of Minimal Sequential Transducers The UnsortedData Algorithm for Acyclic Sequential Transducers
"... This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) from a list of input and output strings. The algorithm generalizes a known method of constructing minimal finitestate automata (Daciuk, Mihov, Watson and Watson 2000). Unlike ..."
Abstract
 Add to MetaCart
This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) from a list of input and output strings. The algorithm generalizes a known method of constructing minimal finitestate automata (Daciuk, Mihov, Watson and Watson 2000). Unlike
PartofSpeech Tagging with Two Sequential Transducers
, 2000
"... The article presents a method of constructing and applying a cascade consisting of a leftand a rightsequential finitestate transducer, , for partofspeech disambiguation. In the process of POS tagging, every word is first assigned a unique ambiguity class that represents the set of alternati ..."
Abstract
 Add to MetaCart
The article presents a method of constructing and applying a cascade consisting of a leftand a rightsequential finitestate transducer, , for partofspeech disambiguation. In the process of POS tagging, every word is first assigned a unique ambiguity class that represents the set
MyhillNerode Theorem for Sequential Transducers over Unique GCDMonoids
"... Abstract. We generalize the classical MyhillNerode theorem for finite automata to the setting of sequential transducers over unique GCDmonoids, which are cancellative monoids in which every two nonzero elements admit a unique greatest common (left) divisor. We prove that a given formal power serie ..."
Abstract
 Add to MetaCart
Abstract. We generalize the classical MyhillNerode theorem for finite automata to the setting of sequential transducers over unique GCDmonoids, which are cancellative monoids in which every two nonzero elements admit a unique greatest common (left) divisor. We prove that a given formal power
FiniteState Transducers in Language and Speech Processing
 Computational Linguistics
, 1997
"... Finitestate machines have been used in various domains of natural language processing. We consider here the use of a type of transducers that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential stringtostring transducer ..."
Abstract

Cited by 392 (42 self)
 Add to MetaCart
Finitestate machines have been used in various domains of natural language processing. We consider here the use of a type of transducers that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential string
Results 1  10
of
150