Sciweavers

2465 search results - page 14 / 493
» Automata on Linear Orderings
Sort
View
LICS
2007
IEEE
15 years 3 months ago
Higher-Order Matching, Games and Automata
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
Colin Stirling
CORR
2007
Springer
89views Education» more  CORR 2007»
14 years 9 months ago
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
Joost Engelfriet, Hendrik Jan Hoogeboom