2 research outputs found
Universality of Confluent, Self-Loop Deterministic Partially Ordered NFAs is Hard
An automaton is partially ordered if the only cycles in its transition
diagram are self-loops. The expressivity of partially ordered NFAs (poNFAs) can
be characterized by the Straubing-Th\'erien hierarchy. Level 3/2 is recognized
by poNFAs, level 1 by confluent, self-loop deterministic poNFAs as well as by
confluent poDFAs, and level 1/2 by saturated poNFAs. We study the universality
problem for confluent, self-loop deterministic poNFAs. It asks whether an
automaton accepts all words over its alphabet. Universality for both NFAs and
poNFAs is a PSpace-complete problem. For confluent, self-loop deterministic
poNFAs, the complexity drops to coNP-complete if the alphabet is fixed but is
open if the alphabet may grow. We solve this problem by showing that it is
PSpace-complete if the alphabet may grow polynomially. Consequently, our result
provides a lower-bound complexity for some other problems, including inclusion,
equivalence, and -piecewise testability. Since universality for saturated
poNFAs is easy, confluent, self-loop deterministic poNFAs are the simplest and
natural kind of NFAs characterizing a well-known class of languages, for which
deciding universality is as difficult as for general NFAs.Comment: arXiv admin note: text overlap with arXiv:1609.0346
Piecewise Testable Languages and Nondeterministic Automata
A regular language is -piecewise testable if it is a finite boolean
combination of languages of the form , where and . Given a DFA and , it is an NL-complete problem to decide whether the language is
piecewise testable and, for , it is coNP-complete to decide whether the
language is -piecewise testable. It is known that the depth of the
minimal DFA serves as an upper bound on . Namely, if is piecewise
testable, then it is -piecewise testable for equal to the depth of .
In this paper, we show that some form of nondeterminism does not violate this
upper bound result. Specifically, we define a class of NFAs, called ptNFAs,
that recognize piecewise testable languages and show that the depth of a ptNFA
provides an (up to exponentially better) upper bound on than the minimal
DFA. We provide an application of our result, discuss the relationship between
-piecewise testability and the depth of NFAs, and study the complexity of
-piecewise testability for ptNFAs.Comment: Corrections in section 4.