Reports

 

The Sequence Equivalence Problem Is Decidable for OS Systems ; CU-CS-137-78 Public Deposited

Downloadable Content

Download PDF
https://scholar.colorado.edu/concern/reports/7p88ch39r
Abstract
  • OS systems generalize context-free grammars without non-terminals. It is shown that it is decidable whether or not two arbitrary OS systems generate the same set of (derivation0 sequences. As a corollary we get that it is decidable whether or not two arbitrary context free grammars have the same sets of derivation sequences.
Creator
Date Issued
  • 1978-09-01
Academic Affiliation
Last Modified
  • 2019-12-21
Resource Type
Rights Statement
Language

Relationships

Items