Finite automata and their decision problems
IBM Journal of Research and Development
| Hi-index | 14.98 |
The Rabin and Scott [1] model of finite automata (both deterministic and nondeterministic) is generalized by allowing the state transitions and final state set to be functions of time. The basic line of inquiry in this paper follows the spirit of the work of Rabin and Scott. Although a few theorems in this present paper are due to Agasandjan [2], [3] who presumably initiated the study of time-variant automata, most results are the author's original contribution.