Pages that link to "Item:Q2556750"
From MaRDI portal
The following pages link to Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems (Q2556750):
Displaying 5 items.
- On equality of multiplicity sets of regular languages (Q1087336) (← links)
- Grammars with valuations - a discrete model for self-organization of biopolymers (Q1164435) (← links)
- The decidability of the DOL-DTOL equivalence problem (Q1167540) (← links)
- Description of developmental languages using recurrence systems (Q4072878) (← links)
- Some decidability problems of sentential formst † (Q4191619) (← links)
