Login / Signup

Characterizations of the Decidability of Some Problems for Regular Trace Languages.

IJsbrand Jan AalbersbergHendrik Jan Hoogeboom
Published in: Math. Syst. Theory (1989)
Keyphrases
  • databases
  • neural network
  • information extraction
  • np complete
  • expressive power
  • real time
  • machine learning
  • artificial intelligence
  • relational databases
  • solving problems
  • transitive closure