Login / Signup

PSPACE-complete problems for subgroups of free groups and inverse finite automata.

Jean-Camille BirgetStuart W. MargolisJohn C. MeakinPascal Weil
Published in: Theor. Comput. Sci. (2000)
Keyphrases
  • finite automata
  • np complete
  • pspace complete
  • tree automata
  • model checking
  • decision problems
  • regular expressions
  • strips planning
  • machine learning
  • np hard
  • knowledge representation