𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorics of Boolean automata circuits dynamics

✍ Scribed by Jacques Demongeot; Mathilde Noual; Sylvain Sené

Book ID
113564730
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
597 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-cancellative Boolean circuits: A gen
Non-cancellative Boolean circuits: A generalization of monotone boolean circuits
✍ Rimli Sengupta; H. Venkateswaran 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

Cancellations are known to be helpful in e cient algebraic computation of polynomials over ÿelds. We deÿne a notion of cancellation in Boolean circuits and deÿne Boolean circuits that do not use cancellation to be non-cancellative. Non-cancellative Boolean circuits are a natural generalization of mo

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