Pages that link to "Item:Q1401337"
From MaRDI portal
The following pages link to A recognition and parsing algorithm for arbitrary conjunctive grammars. (Q1401337):
Displayed 10 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- On the number of nonterminals in linear conjunctive grammars (Q596108) (← links)
- Complexity of equations over sets of natural numbers (Q633764) (← links)
- One-nonterminal conjunctive grammars over a unary alphabet (Q639852) (← links)
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata (Q736618) (← links)
- The hardest linear conjunctive language (Q1007613) (← links)
- On the closure properties of linear conjunctive languages. (Q1874415) (← links)
- Conjunctive grammars and alternating pushdown automata (Q2377302) (← links)
- LINEAR CONJUNCTIVE GRAMMARS AND ONE-TURN SYNCHRONIZED ALTERNATING PUSHDOWN AUTOMATA (Q2941092) (← links)
- LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata (Q3007638) (← links)