Wordt geladen...
Regular expression order-sorted unification and matching
We extend order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottom-up unranked tree automaton. We prove that regular expression order-sorted (REOS) unification is of type infinitary and...
Bewaard in:
| Gepubliceerd in: | J Symb Comput |
|---|---|
| Hoofdauteurs: | , |
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
Elsevier Limited
2015
|
| Onderwerpen: | |
| Online toegang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4599633/ https://ncbi.nlm.nih.gov/pubmed/26523088 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1016/j.jsc.2014.08.002 |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|