Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata

The purpose of this research is to develop some tools that can be used to investigate what happens to a large permanent magnet motor following an internal fault.. while

gnétique des électrons de conduction dans les métaux entraîne une polarisation des spins nucléaires qui peut devenir très importante lorsque la tempéra-.. ture est

Moreover, in the case of coBüchi automata, we show that the procedure is more efficient than its analog looking for a deterministic automaton, since checking for GFGness is

• How does the proposed algorithm behave if the t faulty processes can exhibit a malicious behavior. ⋆ a malicious process can disseminate wrong

This paper gives a polynomial algorithm for the synthesis of a non-deterministic asynchronous automaton from a regular Mazurkiewicz trace language.. This new construction is based on

In this paper we improve the construction, in that the size of the obtained asynchronous automaton is polynomial in the size of a given DFA and simply exponential in the number

We now show that from the definition of self-verifying finite automata which do not allow for computations on any input word finishing in both accepting and rejecting states, we

Proof. The following lemma describes a specific class of minimal n-state NFAs, for which the DFAs obtained by the common subset construction do not contain equivalent states. The