The following pages link to The dual of concatenation (Q2575759):
Displaying 14 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- Language equations with complementation: expressive power (Q764318) (← links)
- Language equations with complementation: decision problems (Q880178) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- Distributional learning of conjunctive grammars and contextual binary feature grammars (Q2424694) (← links)
- Recursive descent parsing for Boolean grammars (Q2641876) (← links)
- Conditional concatenation (Q2708313) (← links)
- Learning Conjunctive Grammars and Contextual Binary Feature Grammars (Q2799213) (← links)
- NOTES ON DUAL CONCATENATION (Q3401485) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311142) (← links)
- Verified decision procedures for MSO on words based on derivatives of regular expressions (Q5371957) (← links)
- The Hardest Language for Conjunctive Grammars (Q5740196) (← links)
- On undecidability of the propositional logic of an associative binary modality (Q6617171) (← links)