S.Ginsburg, S.Greibach, and M.A.Harrison: One-way stack automata, Journal of the ACM 14 (1967), 389-418. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Petri Net Algorithms in the Theory of Matrix Grammars - Hauschildt, Jantzen (1994) (43 citations) (Correct)
....problem for L (M; CF) see the remark above) The inclusions L (RC; CF) L (M; CF) ae RE have some implications to closure properties as well: Corollary 6.2 The families L (RC; CF) and L (M; CF) are not closed with respect to intersection or to complementation. Proof: It is well known (see [GGH 67, Theorem 3.1] that the closure of CF with respect to homomorphism and intersection is the class of recursive enumerable languages. Since both, L (RC; CF) and L (M; CF) contain CF and are closed with respect to homomorphism, but are strictly contained in RE, they cannot be closed with respect to ....
S.Ginsburg, S.Greibach, and M.A.Harrison: One-way stack automata, Journal of the ACM 14 (1967), 389-418.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC