The Sequence Equivalence Problem is Decidable for 0S Systems

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: A. Ehrenfeucht Department of Computer Science, University of Colorado at Boulder, Boulder, Coloroda
G. Rozenberg Institute of Applied Mathematics and Computer Science, University of Leiden, 2300 RA Leiden, The Netherlands
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 27 Issue 4, Oct. 1980
Pages 656-663
ACM New York, NY, USA
table of contents doi>10.1145/322217.322222
The Sequence Equivalence Problem is Decidable for 0S Systems Published by ACM 1980 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 3
· Downloads (cumulative): 223
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder