The equivalence of pre-NTS grammars is decidable (Q3992022): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3859267 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NTS languages are deterministic and congruential / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5576254 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new class of C.F.L. for which the equivalence is decidable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The equivalence and inclusion problems for NTS languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The equivalence problem for deterministic finite-turn pushdown automata / rank | |||
Normal rank | |||
Latest revision as of 16:29, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equivalence of pre-NTS grammars is decidable |
scientific article |
Statements
The equivalence of pre-NTS grammars is decidable (English)
0 references
28 June 1992
0 references
pre-NTS grammars
0 references
decidable equivalence problem
0 references
