Login / Signup

Markov Automata: Deciding weak bisimulation by means of non-naïvely vanishing states.

Johann SchusterMarkus Siegle
Published in: Inf. Comput. (2014)
Keyphrases
  • finite state machines
  • markov chain
  • database
  • cellular automata
  • finite automata
  • text classification
  • case study
  • search algorithm
  • multi class
  • text categorization
  • regular expressions
  • probabilistic automata