Minimizing Finite Complete Pre xes
نویسنده
چکیده
منابع مشابه
Inference of !-languages from pre$xes
B+ uchi automata are used to recognize languages of in$nite strings. Such languages have been introduced to describe the behavior of real-time systems or in$nite games. The question of inferring them from in$nite examples has already been studied, but it may seem more reasonable to believe that the data from which we want to learn is a set of $nite strings, namely the pre$xes of accepted or rej...
متن کاملInteractive Synthesis of Asynchronous Systems based on Partial Order Semantics
An interactive synthesis of asynchronous circuits from Signal Transition Graphs (STGs) based on partial order semantics is presented. In particular, the fundamental problem of encoding con icts in the synthesis is tackled, using partial orders in the form of STG unfolding pre xes. They o er a compact representation of the reachable state space and have the added advantage of simple structures. ...
متن کامل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 ...
متن کاملXenoestrogens at Picomolar to Nanomolar Concentrations Trigger Membrane Estrogen Receptor-α–Mediated Ca2+ Fluxes and Prolactin Release in GH3/B6 Pituitary Tumor Cells
Xenoestrogens (XEs) are widespread in our environment and are known to have deleterious effects in animal (and perhaps human) populations. Acting as inappropriate estrogens, XEs are thought to interfere with endogenous estrogens such as estradiol (E2) to disrupt normal estrogenic signaling. We investigated the effects of E2 versus several XEs representing organochlorine pesticides (dieldrin, en...
متن کاملBisimulations for a Calculus of Broadcasting Systems
We develop a theory of bisimulation equivalence for the broadcast calculus CBS Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a characterisation as the largest CBS con gruences contained in an appropriate version of barbed bisimulation We then present sound and complete proof systems for both the strong and weak congruences over nite expressions T...
متن کامل