The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs H. Yenigün, N. Yevtushenko, N. Kushik
Material type:
ArticleSubject(s): детерминированные конечные машины | синхронизирующие последовательностиGenre/Form: статьи в журналах Online resources: Click here to access online
In:
Information processing letters Vol. 127. P. 49-53Abstract: In this paper, we address the problem of setting a deterministic Finite State Machine (FSM) to a designated initial state. Differently from other papers, we propose to use adaptive synchronizing sequences (test cases) for this purpose and show that for weakly-connected deterministic complete reduced FSMs the problem of checking the existence of an adaptive synchronizing sequence is in P. For partial deterministic reduced FSMs the problem is PSPACE-complete.
Библиогр.: 9 назв.
In this paper, we address the problem of setting a deterministic Finite State Machine (FSM) to a designated initial state. Differently from other papers, we propose to use adaptive synchronizing sequences (test cases) for this purpose and show that for weakly-connected deterministic complete reduced FSMs the problem of checking the existence of an adaptive synchronizing sequence is in P. For partial deterministic reduced FSMs the problem is PSPACE-complete.
There are no comments on this title.