𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Languages represented by Boolean formulas

✍ Scribed by Helmut Veith

Book ID
104137469
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
528 KB
Volume
63
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Succinct representation of regular langu
Succinct representation of regular languages by boolean automata
✍ Ernst Leiss πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 346 KB

Boolean automata are a generalization of finite automata in the sense that the 'next state'i i.e. the result of the transition function given a state and a letter, is not just a single state (deterministic automata) or a union of states (nondeterministic automata) but a boolean function of states. B

Computation of signal output probability
Computation of signal output probability for Boolean functions represented by OBDD
✍ Yingtao Jiang; Yuke Wang; Xiaoyu Song; Y. Savaria πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 556 KB

In [1] and [2], two algorithms have been proposed to calculate the output probability of Boolean functions represented by OBDDs, assuming that the input variables are equiprobable and each variable is statistically independent from others. In this paper, we point out that under these assumptions,