Login / Signup

Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars.

Katsuhiko NakamuraKeita Imada
Published in: LATA (2013)
Keyphrases
  • finite state automata
  • finite automata
  • cellular automata
  • natural language
  • finite state machines
  • context free
  • case study
  • closed form
  • finite state
  • linear constraints