ロード中...
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...
保存先:
| 出版年: | J Symb Comput |
|---|---|
| 主要な著者: | , |
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Elsevier Limited
2015
|
| 主題: | |
| オンライン･アクセス: | 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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|