Deciding Universality of ptNFAs is PSpace-Complete.

Tomás Masopust Markus Krötzsch

Published in: SOFSEM (2018)

Keyphrases

pspace complete
np complete
model checking
satisfiability problem
decision problems
exptime complete
strips planning
tree automata
cellular automata
temporal logic
causal graph
dynamic systems
finite state
computational complexity
query answering
markov chain
query processing