The following pages link to (Q3785993):
Displaying 4 items.
- On limitations of structured (deterministic) DNNFs (Q778525) (← links)
- The complexity of regular DNLC graph languages (Q909473) (← links)
- On the membership problem for regular DNLC grammars (Q1082088) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)