Minimization algorithms for sequential transducers
نویسندگان
چکیده
منابع مشابه
Minimization algorithms for sequential transducers
We present general algorithms for minimizing sequential nite-state transducers that output strings or numbers. The algorithms are shown to be e cient since in the case of acyclic transducers and for output strings they operate in O(S + |E|+ |V |+ (|E| − |V |+ |F |) · (|Pmax|+ 1)) steps, where S is the sum of the lengths of all output labels of the resulting transducer, E the set of transitions ...
متن کاملMinimization of Sequential Transducers
We present an algorithm for minimizing sequential transducers. This algorithm is shown to be eecient, since in the case of acyclic transducers it operates in O(jEj + jV j + (Ej ? jV j + jFj):(jPmaxj + 1) steps, where E is the set of edges of the given transducer, V the set of its vertices, F the set of nal states, and Pmax the longest of the greatest common preexes of the output paths leaving e...
متن کاملNew Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
This paper presents sequential and parallel derivative-free algorithms for finding a local minimum of smooth and nonsmooth functions of practical interest. It is proved that, under mild assumptions, a sufficient decrease condition holds for a nonsmooth function. Based on this property, the algorithms explore a set of search directions and move to a point with a sufficiently lower functional val...
متن کاملMinimization of Symbolic Transducers
Symbolic transducers extend classical finite state transducers to infinite or large alphabets like Unicode, and are a popular tool in areas requiring reasoning over string transformations where traditional techniques do not scale. Here we develop the theory for and an algorithm for computing quotients of such transducers under indistinguishability preserving equivalence relations over states su...
متن کاملCovert Channels with Sequential Transducers⋆
Covert channels represent a security problem for information systems, since they permit illegal flows and sometimes leaks of classified data. Although numerous descriptions have been given at a concrete level, relatively few work has been carried out at a more abstract level. In this paper, we propose a definition for covert channels based on encoding and decoding binary messages with transduce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00115-7