The undecidability of form equivalence for context-free and EOL forms (Q1069311)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The undecidability of form equivalence for context-free and EOL forms |
scientific article; zbMATH DE number 3934423
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The undecidability of form equivalence for context-free and EOL forms |
scientific article; zbMATH DE number 3934423 |
Statements
The undecidability of form equivalence for context-free and EOL forms (English)
0 references
1984
0 references
This paper studies the decidability status of various equivalence problems in form theory. Most of our discussions concern the notion of a language form. We compare the form equivalence problem between language forms with the ordinary equivalence problem between languages. However, the main results deal with L forms and grammar forms under strict interpretations. We prove that the form equivalence problem is undecidable for (a) context-free grammar forms, and (b) EOL forms. The proofs of these results are based on our investigations concerning language forms.
0 references
decidability
0 references
language form
0 references
form equivalence problem
0 references
equivalence problem between languages
0 references
L forms
0 references
context-free grammar forms
0 references
EOL forms
0 references
0.78768390417099
0 references
0.7572406530380249
0 references
0.7526864409446716
0 references
0.7523586750030518
0 references