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

Katsuhiko Nakamura, Keita Imada. Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars. In Adrian Horia Dediu, Carlos Martín-Vide, Bianca Truthe, editors, Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings. Volume 7810 of Lecture Notes in Computer Science, pages 444-455, Springer, 2013. [doi]

@inproceedings{NakamuraI13,
  title = {Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars},
  author = {Katsuhiko Nakamura and Keita Imada},
  year = {2013},
  doi = {10.1007/978-3-642-37064-9_39},
  url = {http://dx.doi.org/10.1007/978-3-642-37064-9_39},
  researchr = {https://researchr.org/publication/NakamuraI13},
  cites = {0},
  citedby = {0},
  pages = {444-455},
  booktitle = {Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings},
  editor = {Adrian Horia Dediu and Carlos Martín-Vide and Bianca Truthe},
  volume = {7810},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-37063-2},
}