Login / Signup
An Automaton Group with PSPACE-Complete Word Problem.
Jan Philipp Wächter
Armin Weiß
Published in:
CoRR (2019)
Keyphrases
</>
finite state
pspace complete
tree automata
model checking
word problems
temporal logic
strips planning
np complete
satisfiability problem
decision problems
lower bound