Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Conference

Unranked Tree Rewriting and Effective Closures of Languages

Subjects: Term Rewriting; XML Updates; Tree AutomataEindhoven; Netherlands

  • Source: Meeting of the IFIP WG 1.6 on Term Rewriting ; https://inria.hal.science/hal-00852379 ; Meeting of the IFIP WG 1.6 on Term Rewriting, Jun

تفاصيل العنوان

×
Conference

Closure of Hedge-Automata Languages by Hedge Rewriting

Subjects: [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]Hagenberg; Austria

  • Source: 19th International Conference on Rewriting Techniques and Applications - RTA 2008https://inria.hal.science/inria-0032980319th International Conference on

تفاصيل العنوان

×
Conference

A Rewriting Approach to the Combination of Data Structures with Bridging Theories

Subjects: [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]; [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR]Wroclaw; Poland

  • Source: Frontiers of Combining Systems - 10th International Symposium, FroCoS 2015 ; https://inria.hal.science/hal-01206187 ; Frontiers of Combining Systems - 10th International Symposium, FroCoS 2015, Sep

تفاصيل العنوان

×
Conference

Rewrite-Based Verification of XML Updates

Subjects: Verification; Languages Theory; SecurityHagenberg; Austria

  • Source: 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming (PPDP)https://inria.hal.science/inria-0057891612th international ACM SIGPLAN symposium on

تفاصيل العنوان

×
Conference

Towards an automatic tool for multi-scale model derivation illustrated with a micro-mirror array

Subjects: Symbolic computation; computer-aided derivation of asymptotic models; micro-mirror arrayTimisoara; Romania

  • Source: 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015https://inria.hal.science/hal-0124320417th International Symposium on Symbolic and

تفاصيل العنوان

×
Academic Journal

Handling Non Left-Linear Rules When Completing Tree Automata

Subjects: Rewriting techniques; tree automata; left-linearity

  • Source: ISSN: 0129-0541 ; International Journal of Foundations of Computer Science ; https://hal.science/hal-00561373 ; International Journal of Foundations of Computer Science, 2009, 20 (5), pp.837--849.

تفاصيل العنوان

×
  • 1-10 ل  51 نتائج ل ""Rewriting""