Complexity of universality and related problems for partially ordered NFAs

Abstract

Partially ordered nondeterministic finite automata (poNFAs) are NFAs whose transition relation induces a partial order on states, that is, for which cycles occur only in the form of self-loops on a single state. A poNFA is universal if it accepts all words over its input alphabet. Deciding universality is PSpace-complete for poNFAs, and we show that this remains true even when restricting to a fixed alphabet. This is nontrivial since standard encodings of alphabet symbols in, e.g., binary can turn self-loops into longer cycles. A lower coNP-complete complexity bound can be obtained if we require that all self-loops in the poNFA are deterministic, in the sense that the symbol read in the loop cannot occur in any other transition from that state. We find that such restricted poNFAs (rpoNFAs) characterize the class of R-trivial languages, and we establish the complexity of deciding if the language of an NFA is R-trivial. Nevertheless, the limitation to fixed alphabets turns out to be essential even in the restricted case: deciding universality of rpoNFAs with unbounded alphabets is PSpace-complete. Based on a close relation between universality and the problems of inclusion and equivalence, we also obtain the complexity results for these two problems. Finally, we show that the languages of rpoNFAs are definable by deterministic (one-unambiguous) regular expressions, which makes them interesting in schema languages for XML data.

Complexity of deciding detectability in discrete event systems

“…The illustration of the proof of Theorem 9 over Σ, whether L(A) = Σ * . It is PSpace-complete in general and coNP-complete if the alphabet is fixed a priori[7]. Deciding weak (periodic) detectability of DESs modeled as rpoNFAs is PSpace-complete even if all events are observable.…”

Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata

“…This is in concordance with [27]. However, partially ordered automata are sometimes allowed to be partial in the literature [20]. Equivalently, an automaton is weakly acyclic if and only if there exists an ordering q 1 , .…”

K-Step Opacity in Discrete Event Systems: Verification, Complexity, and Relations

“…This path plays the role of a K-step counter that is essential in the transformation from K-SO to CSO of Section IV-B. To construct the automaton A K , we make use of NFAs A k,n , for every k, n ≥ 1, that can be constructed in time polynomial in k and n and that are similar to NFAs we used earlier [23], though we need to adjust them. Lemma 13.…”