5 search results - page 1 / 1 » Lambek Calculus Proofs and Tree Automata |
LACL
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
ACL
1989
13 years 5 months ago
1989
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
ILC
2007
Springer
13 years 10 months ago
2007
Springer
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
LICS
2007
IEEE
13 years 11 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...