Login / Signup

On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store.

Pavol DurisZvi Galil
Published in: ICALP (1982)
Keyphrases
  • model checking
  • lower bound
  • finite state
  • small size
  • neural network
  • cellular automata
  • turing machine
  • upper bound
  • worst case
  • asymptotically optimal
  • finite state automata
  • regular expressions
  • bounded treewidth