𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the existence of hybrid models for finite state machines

✍ Scribed by Ekaterina S. Lemch; Peter E. Caines

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
133 KB
Volume
36
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

✦ Synopsis

Within the framework of the hierarchical hybrid control theory presented in (Caines and Wei, IEEE Trans. Automat. Control 43 (4) (1988) 501-508), one may pose the following hybrid modelling problem: for a given ΓΏnite state machine M , ΓΏnd a state space D, a state space partition , and a controlled ODE system S on D such that the associated hierarchical hybrid partition machine M is a hybrid in-block controllable machine which is isomorphic to M . In this paper a constructive solution is given to this problem for all ΓΏnite machines M .

πŸ“œ 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