Journal of the ACM Bibliography

Selected papers that cite this one

• Valentin Antimirov. Partial derivatives of regular expressions and finite automaton constructions. Theoretical Computer Science, 155(2):291-319, 11 March 1996.

• Ricardo A. Baeza-Yates and Gaston H. Gonnet. Fast string matching with mismatches. Information and Computation, 108(2):187-199, 1 February 1994.

• Gérard Berry and Georges Gonthier. The ESTEREL synchronous programming language: design, semantics, implementation. Science of Computer Programming, 19(2):87-152, November 1992.

• Anne Brüggemann-Klein and Derick Wood. One-unambiguous regular languages. Information and Computation, 142(2):182-206, 1 May 1998.

• Anne Brüggemann-Klein and Derick Wood. One-unambiguous regular languages. Information and Computation, 140(2):229-253, 1 February 1998.

• J. A. Brzozowski. Roots of star events. Journal of the ACM, 14(3):466-477, July 1967.

• J. A. Brzozowski and Rina Cohen. On decompositions of regular events. Journal of the ACM, 16(1):132-144, January 1969.

• Chia-Hsiang Chang and Robert Paige. From regular expressions to DFA's using compressed NFA's. Theoretical Computer Science, 178(1-2):1-36, 30 May 1997. Fundamental Study.

• Andrzej Ehrenfeucht, Joost Engelfriet, and Grzegorz Rozenberg. Finite languages for the representation of finite graphs. Journal of Computer and System Sciences, 52(1):170-184, February 1996.

• A. Ginzburg. A procedure for checking equality of regular expressions. Journal of the ACM, 14(2):355-362, April 1967.

• Teodor Knapik and Étienne Payet. The full quotient and its closure property for regular languages. Information Processing Letters, 65(2):57-62, 29 January 1998.

• A. Paz and B. Peleg. Ultimate-definite and symmetric-definite events and automata. Journal of the ACM, 12(3):399-410, July 1965.

• Arto Salomaa. Two complete axiom systems for the algebra of regular events. Journal of the ACM, 13(1):158-169, January 1966.

• Jeffrey Shallit and Yuri Breitbart. Automaticity I: Properties of a measure of descriptional complexity. Journal of Computer and System Sciences, 53(1):10-25, August 1996.

Selected references

• Irving M. Copi, Calvin C. Elgot, and Jesse B. Wright. Realization of events by logical nets. Journal of the ACM, 5(2):181-196, April 1958.

• C. C. Elgot and J. D. Rutledge. Operations of finite automata. In Proceedings of the Second Annual Symposium and Papers from the First Annual Symposium on Switching Circuit Theory and Logical Design, pages 129-132. American Institute of Electrical Engineers, 1961, Conference held 17-20 October, 1961, in Detroit, Michigan.

• Gene Ott and Neil H. Feinstein. Design of sequential machines from their regular expressions. Journal of the ACM, 8(4):585-600, October 1961.

• George N. Raney. Sequential functions. Journal of the ACM, 5(2):177-180, April 1958.

Shortcuts: