On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone.
Hartmut MesserschmidtFriedrich OttoPublished in: CSR (2006)
Keyphrases
- finite state automaton
- turing machine
- cellular automata
- finite automata
- social networks
- boolean functions
- regular expressions
- real world
- upper bound
- deterministic finite automata
- finite state machines
- deterministic automata
- formal language theory
- lattice gas
- probabilistic automata
- monotonicity constraints
- stochastic methods
- finite state
- database
- case study
- machine learning
- neural network
- databases