Pages that link to "Item:Q3520304"
From MaRDI portal
The following pages link to On the Computational Completeness of Equations over Sets of Natural Numbers (Q3520304):
Displayed 10 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- On the expressive power of univariate equations over sets of natural numbers (Q418146) (← links)
- One-nonterminal conjunctive grammars over a unary alphabet (Q639852) (← links)
- Representing hyper-arithmetical sets by equations over sets of integers (Q693054) (← links)
- Language equations with complementation: expressive power (Q764318) (← links)
- Conjunctive grammars with restricted disjunction (Q974750) (← links)
- One-Nonterminal Conjunctive Grammars over a Unary Alphabet (Q3392954) (← links)
- Functions Definable by Arithmetic Circuits (Q3576073) (← links)
- Conjunctive Grammars with Restricted Disjunction (Q3599090) (← links)
- On Equations over Sets of Numbers and Their Limitations (Q3637239) (← links)