𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Boolean Algebras of Regular Languages

✍ Scribed by Konovalov*, A. S.; Selivanov* **, V. L.


Book ID
121541021
Publisher
Springer US
Year
2014
Tongue
English
Weight
1007 KB
Volume
52
Category
Article
ISSN
0002-5232

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Succinct representation of regular langu
✍ 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