Reports

 

A Pumping Theorem for EDTOL Languages ; CU-CS-047-74 Public Deposited

https://scholar.colorado.edu/concern/reports/z029p552n
Abstract
  • This paper is concerned with deterministic ETOL languages. A theorem is proved which, roughly speaking, says that if an ETOL language contains a word which a special property then it must contain an infinite set of words obtained from the given one by “synchronously pumping” a number of subwords of the given word. This theorem has numerous applications for proving that certain languages are not deterministic ETOL languages.
Creator
Date Issued
  • 1974-07-01
Academic Affiliation
Last Modified
  • 2019-12-21
Resource Type
Rights Statement
Language

Relationships

Items