𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of ideals in finite semigroups and finite-state machines

✍ Scribed by Kenneth Krohn; Richard Mateosian; John Rhodes

Publisher
Springer
Year
1967
Tongue
English
Weight
484 KB
Volume
1
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounds on the complexity of recurrent ne
Bounds on the complexity of recurrent neural network implementations of finite state machines
✍ Bill G. Horne; Don R. Hush πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 823 KB

In this paper the efficiency of recurrent neural network implementations of m-state finite state machines will be explored. Specifically, it will be shown that the node complexity for the unrestricted case can be bounded above by O(v/-m-). It will also be shown that the node complexity is 0( ~) when