eCommons

 

Simple Programs on Strings and Their Decision Problems

Other Titles

Abstract

Classes of simple programs operating on srings are considered. Their power as acceptors and their power as generation devices are compared and consequences on upper bounds and lower bounds for several decision problems are derived. It is shown that even for such a small class of programs some problems are undecidable.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1975-11

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR75-263

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record