The following pages link to Sebastian Eberhard (Q1622972):
Displaying 9 items.
- Complexity of decision problems on totally rigid acyclic tree grammars (Q1622974) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- Inductive theorem proving based on tree grammars (Q2344621) (← links)
- Applicative theories for logarithmic complexity classes (Q2346995) (← links)
- A feasible theory of truth over combinatory algebra (Q2637706) (← links)
- Boolean unification with predicates (Q2987044) (← links)
- Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars (Q4608715) (← links)
- (Q4981445) (← links)
- Compressibility of Finite Languages by Grammars (Q5500684) (← links)
