Basic proof theory
Automaticity I: properties of a measure of descriptional complexity
Journal of Computer and System Sciences
Automatic complexity of strings
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Tree Automata with Global Constraints
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Logical Foundations of Proof Complexity
Logical Foundations of Proof Complexity
Rigid tree automata and applications
Information and Computation
Satisfiability of a spatial logic with tree variables
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Towards algorithmic cut-introduction
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Project presentation: algorithmic structuring and compression of proofs (ASCOP)
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
| Hi-index | 0.00 |
We introduce a new connection between formal language theory and proof theory. One of the most fundamental proof transformations in a class of formal proofs is shown to correspond exactly to the computation of the language of a certain class of tree grammars. Translations in both directions, from proofs to grammars and from grammars to proofs, are provided. This correspondence allows theoretical as well as practical applications.