Abstract
This paper investigates two subjects in push-down automata (PDAs) and linear indexed grammars (LIGs), which are extended PDAs, focusing on eliminating the stack symbols. One of the subjects is concerned with PI- (push-input-) PDA and PI-LIG without ε-transition rule, in which only input symbols are pushed down to the stack. It is shown that the class of languages of PI-LIGs is incomparable with that of PDAs, which is the class of context-free languages (CFLs). The other subject is a simple bottom-up parsing method for LIGs, in which the stack symbols are eliminated at the first step of the parsing. The paper shows several PI-LIGs, including PI-PDAs for fundamental context-free and context-sensitive languages, which are synthesized by a grammatical inference system LIG Learner.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aho, A.V.: Indexed grammars: An extension of context-free grammars. J. ACM 15(4), 647–671 (1968)
Alonso, M., de la Clergerie, E., Diaz, V., Vilares, M.: Relating tabular parsing algorithms for LIG and TAG. New Developments in Parsing Technology 23, 157–184 (2005)
Duske, J., Parchmann, R.: Linear indexed languages. Theoretical Computer Science 32(1), 47–60 (1984)
Forgy, C.: Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence 19(1), 17–37 (1982)
Goldstine, J., Price, J.K., Wotschke, D.: On reducing the number of stack symbols in a PDA. Theory of Computing Systems 26(4), 313–326 (1993)
Joshi, A., Levy, L., Takahashi, M.: Tree adjunct grammars. Journal of Computer and System Sciences 10(1), 136–163 (1975)
Joshi, A., Shanker, K., Weir, D.: The convergence of mildly context-sensitive grammar formalisms. In: Foundational Issues in Natural Language Processing, pp. 31–81. MIT Press (1991)
Kallmeyer, L.: Parsing Beyond Context-Free Grammars. Springer (2005)
Nakamura, K.: Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 72–83. Springer, Heidelberg (2006)
Nakamura, K., Imada, K.: Towards incremental learning of mildly context-sensitive grammars. In: 10th International Conference on Machine Learning and Applications (ICMLA 2011), vol. 1, pp. 223–228. IEEE (2011)
Rivas, E., Eddy, S.R.: The language of RNA: a formal grammar that includes pseudoknots. Bioinformatics 16, 334–340 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakamura, K., Imada, K. (2013). Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars. In: Dediu, AH., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2013. Lecture Notes in Computer Science, vol 7810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37064-9_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-37064-9_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37063-2
Online ISBN: 978-3-642-37064-9
eBook Packages: Computer ScienceComputer Science (R0)