Sebastian Eberhard

According to our database, Sebastian Eberhard authored at least 8 papers between 2014 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2018

On the compressibility of finite languages and formal proofs.

Sebastian Eberhard, Stefan Hetzl

Inf. Comput., 2018

Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars.

Sebastian Eberhard, Gabriel Ebner, Stefan Hetzl

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars.

Sebastian Eberhard, Gabriel Ebner, Stefan Hetzl

ACM Trans. Comput. Log., 2017

Boolean unification with predicates.

Sebastian Eberhard, Stefan Hetzl, Daniel Weller

J. Log. Comput., 2017

2015

Applicative theories for logarithmic complexity classes.

Sebastian Eberhard

Theor. Comput. Sci., 2015

Inductive theorem proving based on tree grammars.

Sebastian Eberhard, Stefan Hetzl

Ann. Pure Appl. Log., 2015

Compressibility of Finite Languages by Grammars.

Sebastian Eberhard, Stefan Hetzl

Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014

A feasible theory of truth over combinatory algebra.

Sebastian Eberhard

Ann. Pure Appl. Log., 2014