Pages that link to "Item:Q4181980"
From MaRDI portal
The following pages link to The complexity of the membership problem for some extensions of context-free languagest† (Q4181980):
Displaying 12 items.
- The effective entropies of some extensions of context-free languages (Q751289) (← links)
- Pattern selector grammars and several parsing algorithms in the context- free style (Q1081314) (← links)
- Tree-size bounded alternation (Q1145502) (← links)
- On uniform circuit complexity (Q1152951) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- A geometric hierarchy beyond context-free languages (Q1200806) (← links)
- One way finite visit automata (Q1242687) (← links)
- On languages specified by relative acceptance (Q1249438) (← links)
- Sequential grammars and automata with valences (Q1605318) (← links)
- CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS (Q3401474) (← links)
- Time and space complexity of inside-out macro languages (Q3922197) (← links)
- (Q4168079) (← links)
