Pages that link to "Item:Q4191619"
From MaRDI portal
The following pages link to Some decidability problems of sentential formst † (Q4191619):
Displaying 9 items.
- It is decidable whether a regular language is pure context-free (Q787679) (← links)
- On DOS languages and DOS mappings (Q791326) (← links)
- A regularity test for dual bordered OS systems (Q1060851) (← links)
- On form-equivalence of deterministic pure grammar forms (Q1164436) (← links)
- Representation theorems using DOS languages (Q1836310) (← links)
- Two-symbol DOS systems generating regular languages (Q1836311) (← links)
- A remark on regularity of parallel languages (Q3659170) (← links)
- (Q3680300) (← links)
- Decidability Questions for Insertion Systems and Related Models (Q5164868) (← links)
