Journal of the ACM Bibliography
K.
Culik II. A purely homomorphic characterization of recursively
enumerable sets. Journal of the ACM, 26(2):345-350, April
1979.
[BibTeX entry]
Selected papers that cite this one
- Lucian Ilie and Arto Salomaa. 2-Testability and
relabelings produce everything. Journal of Computer and System
Sciences, 56(3):253-262, April 1998.
- Alexandru Mateescu, Arto Salomaa, Kai Salomaa, and Sheng Yu. P, NP and the Post
correspondence problem. Information and Computation,
121(2):135-142, September 1995.
- Gheorghe P\u{a}un and Grzegorz Rozenberg. Sticker systems.
Theoretical Computer Science, 204(1-2):183-203, 6 September
1998.
- Kai Salomaa. Yield-languages of
two-way pushdown tree automata. Information Processing
Letters, 58(4):195-199, 27 May 1996.
Shortcuts: