๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimization algorithms for sequential transducers

โœ Scribed by Mehryar Mohri

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
198 KB
Volume
234
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The suffix tree of a tree and minimizing
The suffix tree of a tree and minimizing sequential transducers
โœ Dany Breslauer ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1013 KB

This paper gives a linear-time algorithm for the construction of the suffix tree of a tree, which was introduced by Kosaraju, as a natural generalization of the suffix tree of a string. The suffix tree of a tree is used to obtain an efficient algorithm for the minimization of sequential transducers.

Sequential and parallel algorithms for g
Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives
โœ V.P. Gergel; Ya.D. Sergeyev ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 954 KB

In this paper, sequential and parallel algorithms using derivatives for solving unconstrained one-dimensional global optimization problems are described. Sufficient conditions of convergence to all global minimizers are established for both methods. Parallel algorithm conditions, which guarantee sig