Term Rewriting With Prefix Context Constraints and Bottom-Up Strategies

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-21401-6_9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Context Term Calculus for Rewriting Systems

PROBLEMS IN PROGRAMMING
2018English

Some Applications of Prefix-Rewriting in Monoids, Groups, and Rings

2000English

Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols

BRICS Report Series
2006English

Rewriting Strategies and Strategic Rewrite Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Termination of Rewriting Under Strategies

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2009English

Comparing Effectiveness of Top-Down and Bottom-Up Strategies in Containing Influenza

PLoS ONE
Multidisciplinary
2011English

Regularity and Context-Freeness Over Word Rewriting Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

On Context-Free Rewriting With a Simple Restriction and Its Computational Completeness

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2009English

Confluence of Curried Term-Rewriting Systems

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy