Login / Signup

On the Complexity of Equivalence and Minimisation for Q-weighted Automata

Stefan KieferAndrzej S. MurawskiJoël OuaknineBjörn WachterJames Worrell
Published in: Log. Methods Comput. Sci. (2013)
Keyphrases
  • computational complexity
  • worst case
  • multiscale
  • computational cost
  • regular expressions
  • complexity analysis
  • real time
  • information retrieval
  • lower bound
  • cellular automata
  • weighted distance