Finite automata and their decision problems
IBM Journal of Research and Development
| Hi-index | 14.98 |
Events representable in stochastic sequential machines, as defined previously by several authors, are shown to be regular in certain cases. The construction of deterministic machines representing those events is implicit.