z-logo
open-access-imgOpen Access
Towards Deciding Second-order Unification Problems Using Regular Tree Automata
Author(s) -
Tomer Libal
Publication year - 2015
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
Subject(s) - unification , decidability , undecidable problem , tree automaton , tree (set theory) , computer science , order (exchange) , automaton , discrete mathematics , algebra over a field , class (philosophy) , theoretical computer science , mathematics , algorithm , programming language , combinatorics , pure mathematics , artificial intelligence , finance , economics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom