Skip to Main content Skip to Navigation
New interface
Conference papers

On the Complexity of Universality for Partially Ordered NFAs

Abstract : Partially ordered nondeterminsitic finite automata (poNFAs) are NFAs whose transition relation induces a partial order on states, i.e., 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) characterise 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. Our results also prove the complexity of the inclusion and equivalence problems, since universality provides the lower bound, while the upper bound is mostly known or proved in the paper.
Complete list of metadata

Cited literature [37 references]  Display  Hide  Download
Contributor : Michaël Thomazo Connect in order to contact the contributor
Submitted on : Tuesday, June 21, 2016 - 3:21:56 PM
Last modification on : Saturday, June 25, 2022 - 8:30:13 PM
Long-term archiving on: : Thursday, September 22, 2016 - 12:31:30 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Markus Krötzsch, Tomáš Masopust, Michaël Thomazo. On the Complexity of Universality for Partially Ordered NFAs . 41st International Symposium on Mathematical Foundations of Computer Science , Aug 2016, Krakow, Poland. ⟨10.4230/LIPIcs.MFCS.2016.62⟩. ⟨hal-01334958⟩



Record views


Files downloads