Pages that link to "Item:Q913524"
From MaRDI portal
The following pages link to A characterisation of deterministic context-free languages by means of right-congruences (Q913524):
Displaying 10 items.
- On DOS languages and DOS mappings (Q791326) (← links)
- Some decision problems about controlled rewriting systems (Q910246) (← links)
- Characterizations of right dense languages (Q1068212) (← links)
- NTS languages are deterministic and congruential (Q1083220) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- On languages defined by generalized principal right congruences (Q2153030) (← links)
- On McNaughton families of languages that are specified by some variants of monadic string-rewriting systems (Q2882391) (← links)
- (Q3809288) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)
- Grammatical Inference: Algorithms and Applications (Q5493035) (← links)