Temporal Infomax on Markov chains with input leads to finite state automata.
Thomas WennekersNihat AyPublished in: Neurocomputing (2003)
Keyphrases
- finite state automata
- probabilistic automata
- markov chain
- finite state machines
- steady state
- markov processes
- state space
- finite state
- random walk
- transition probabilities
- markov process
- finite automata
- markov model
- stochastic process
- hybrid automata
- stationary distribution
- relative entropy
- upper bound
- hidden markov models
- lower bound