Login / Signup

A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata.

Tomás Masopust
Published in: Int. J. Found. Comput. Sci. (2013)
Keyphrases
  • model checking
  • case study
  • finite state
  • turing machine
  • cellular automata
  • finite state machines
  • artificial intelligence
  • pairwise
  • neural network
  • real world
  • decision trees