论文信息 - On Deterministic Indexed Languages

On Deterministic Indexed Languages

A new type of acceptor is introduced for the class of indexed languages. The class of languages recognized by the deterministic version of this acceptor, called deterministic indexed languages, is closed under complemention. The class of deterministic context-free languages is properly contained in the class of deterministic indexed languages, which itself is properly contained in the class of indexed languages.

[1] Hermann A. Maurer,et al. A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language , 1969, JACM.

[2] Alfred V. Aho,et al. Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.

[3] Harry B. Hunt,et al. Polynomial Algorithms for Deterministic Pushdown Automata , 1978, SIAM J. Comput..

[4] T. S. E. Maibaum,et al. Pumping Lemmas for Term Languages , 1978, J. Comput. Syst. Sci..

[5] Alfred V. Aho,et al. Nested Stack Automata , 1969, Journal of the ACM.