Local Encoding Transformations for OptimizingOBDD - Representations of Finite State MachinesChristoph
نویسندگان
چکیده
Electronic copies of technical reports are available: Via FTP: URL ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports Via WWW: URL http://www.informatik.uni-trier.de/Reports/Current.html Via email: Send a mail to [email protected], subject ’HELP’, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..
منابع مشابه
Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines
Ordered binary decision diagrams are the state-of-the-art representation of switching functions. In order to keep the sizes of the OBDDs tractable, heuristics and dynamic reordering algorithms are applied to optimize the underlying variable order. When-nite state machines are represented by OBDDs the state encoding can be used as an additional optimization parameter. In this paper, we analyze l...
متن کاملStrong exponent bounds for the local Rankin-Selberg convolution
Let $F$ be a non-Archimedean locally compact field. Let $sigma$ and $tau$ be finite-dimensional representations of the Weil-Deligne group of $F$. We give strong upper and lower bounds for the Artin and Swan exponents of $sigmaotimestau$ in terms of those of $sigma$ and $tau$. We give a different lower bound in terms of $sigmaotimeschecksigma$ and $tauotimeschecktau$. Using the Langlands...
متن کاملCracking Elements Method for Simulating Complex Crack Growth
The cracking elements method (CEM) is a novel numerical approach for simulating fracture of quasi-brittle materials. This method is built in the framework of conventional finite element method (FEM) based on standard Galerkin approximation, which models the cracks with disconnected cracking segments. The orientation of propagating cracks is determined by local criteria and no explicit or implic...
متن کاملOn Finite-State Tonology with Autosegmental Representations
Building finite-state transducers from written autosegmental grammars of tonal languages involves compiling the rules into a notation provided by the finitestate tools. This work tests a simple, human readable approach to compile and debug autosegmental rules using a simple string encoding for autosegmental representations. The proposal is based on brackets that mark the edges of the tone autos...
متن کاملFinite Automata Encoding Geometric Figures
Finite automata are used for the encoding and compression of images. For black-and-white images, for instance, using the quad-tree representation, the black points correspond to ω-words defining the corresponding paths in the tree that lead to them. If the ω-language consisting of the set of all these words is accepted by a deterministic finite automaton then the image is said to be encodable a...
متن کامل