Journal of the ACM Bibliography

Selected papers that cite this one

• S. A. Greibach. One way finite visit automata. Theoretical Computer Science, 6(2):175-221, April 1978.

• David Harel and Eli Singerman. More on nonregular PDL: Finite models and Fibonacci-like programs. Information and Computation, 128(2):109-118, 1 August 1996.

• Thomas N. Hibbard and Joseph Ullian. The independence of inherent ambiguity from complementedness among context-free languages. Journal of the ACM, 13(4):588-593, October 1966.

• Tirza Hirst and David Harel. On the power of bounded concurrency II: Pushdown automata. Journal of the ACM, 41(3):540-554, May 1994.

• Oscar H. Ibarra. On two-way sequential transductions of full semi-AFL's. Theoretical Computer Science, 7(3):287-309, December 1978.

• Juha Kortelainen. Remarks about commutative context-free languages. Journal of Computer and System Sciences, 56(1):125-129, February 1998.

• Tsutomu Maimiura. Tree automata and attribute grammars. Information and Control, 57(1):1-20, April 1983.

• Herman A. Maurer. A direct proof of the inherent ambiguity of a simple context-free language. Journal of the ACM, 16(2):256-260, April 1969.

• H. Petersen. On the language of primitive words. Theoretical Computer Science, 161(1-2):141-156, 15 July 1996.

• Arnold L. Rosenberg. A note on ambiguity of context-free languages and presentations of semilinear sets. Journal of the ACM, 17(1):44-50, January 1970.

• Egon Wanke. On the decidability of certain integer subgraph problems on context-free graph languages. Information and Computation, 113(1):26-49, 15 August 1994.

Selected references

• Noam Chomsky. On certain formal properties of grammars. Information and Control, 2(2):137-167, June 1959.

• Noam Chomsky and George A. Miller. Finite state languages. Information and Control, 1(2):91-112, May 1958.

• Stephen Scheinberg. Note on the Boolean properties of context free languages. Information and Control, 3(4):372-375, December 1960.

Shortcuts: