ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
A Purely Homomorphic Characterization of Recursively Enumerable Sets
Full text PdfPdf (358 KB)
Source Journal of the ACM (JACM) archive
Volume 26 ,  Issue 2  (April 1979) table of contents
Pages: 345 - 350  
Year of Publication: 1979
ISSN:0004-5411
Author
K. Culik, II  Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 24,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322123.322136
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
J. A. Brzozowski, Roots of Star Events, Journal of the ACM (JACM), v.14 n.3, p.466-477, July 1967  [doi>10.1145/321406.321409]
 
2
CULIK II, K, AND FRIS, 1 The decldabdlty of the equivalence problem for DOL-systems Inform and Control 35 (1977), 20-39
 
3
CULIK I1, K., AND SALOMAA, A On the decldablhty ofhomomorphlsm equivalence for languages. To appear m J Comptr Syst Sct 17 (1978)
 
4
John E. Hopcroft , Jeffrey D. Ullman, Formal languages and their relation to automata, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1969
 
5
SALOMAA, A Equahty Sets for Homomorphlsms of Free Monotds To appear m Acta Cybernetlca
 
6
SALOMAA, A DOL equivalence The problem of iterated homomorphtsms Bull EA TCS (European Assoc Theoret Comptr Scl.) 4 (Jan 1978), 5-12

CITED BY  2
J. Engelfriet , G. Rozenberg, Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages, Journal of the ACM (JACM), v.27 n.3, p.499-518, July 1980
Juhani Karhumäki, Reachability via Cooperating Morphisms, Electronic Notes in Theoretical Computer Science (ENTCS), 223, p.15-27, December, 2008

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.3 LOGICS AND MEANINGS OF PROGRAMS
      F.3.3 Studies of Program Constructs
          Subjects: Program and recursion schemes

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS


General Terms:
Performance, Theory, Verification

Collaborative Colleagues:
K. Culik, II: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player