Thumbnail
Access Restriction
Subscribed

Author Hartmanis, J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1969
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Some general results about hierarchies of undecidable problems in automata theory are given, and studies are described which show how properties of sets accepted by automata (i.e. languages) change from decidable to undecidable problems as the computational power of the automata is increased. This work also yields unified techniques which characterize for different languages large classes of undecidable problems.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1969-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 16
Issue Number 1
Page Count 8
Starting Page 160
Ending Page 167


Open content in new tab

   Open content in new tab
Source: ACM Digital Library