Finite-Automaton Aperiodicity is PSPACE-Complete.

Sang Cho Dung T. Huynh

Published in: Theor. Comput. Sci. (1991)

Keyphrases

pspace complete
finite automaton
tree automata
finite automata
regular expressions
finite state
strips planning
np complete
model checking
context free grammars
satisfiability problem
decision problems
pattern matching
context free
coalition logic