Pages that link to "Item:Q802880"
From MaRDI portal
The following pages link to An efficient recognizer for the Boolean closure of context-free languages (Q802880):
Displaying 6 items.
- Fast nondeterministic recognition of context-free languages using two queues (Q293326) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- The Boolean closure of linear context-free languages (Q929298) (← links)
- Boolean kernels of context-free languages (Q2117675) (← links)
- Developments in Language Theory (Q5711962) (← links)
- Bounded fixed-point definability and tabular recognition of languages (Q6560180) (← links)