Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable (Q2422040): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2018.09.035 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2018.09.035 / rank | |||
Normal rank | |||
Latest revision as of 13:09, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable |
scientific article |
Statements
Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable (English)
0 references
18 June 2019
0 references
recursive program schemes
0 references
higher-order languages
0 references
Dyck language
0 references
Diophantine equations
0 references
