Login / Signup
Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata.
Petr Jiricka
Jaroslav Král
Published in:
Developments in Language Theory (1999)
Keyphrases
</>
finite state
markov chain
markov decision processes
tree automata
model checking
optimal policy
finite state automaton
vector quantizer
context free
deterministic finite automata
average cost
stationary policies
temporal logic
turing machine
policy iteration
regular expressions
continuous time bayesian networks