Jan van Leeuwen
- Haines, L. H., On free monoids partially ordered by embedding, J. Comb. Th. 6 (1969) 94--98.Google Scholar
Cross Ref
- Herman, G. T., and G. Rozenberg, Developmental systems and languages, North-Holland Publ. Co., Amsterdam (1975). Google ScholarDigital Library
- Kruskal, J. B., The theory of well-quasi-ordering: a frequently rediscovered concept, J. Comb. Th. (A) 13 (1973) 297--305.Google ScholarCross Ref
- van Leeuwen, J., Effective constructions in well-partially-ordered free monoids, Techn. Rep. 203, Penn State University (1976).Google Scholar
Index Terms
- A regularity condition for parallel rewriting systems
Recommendations
Conditions for confluence of innermost terminating term rewriting systems
This paper presents a counterexample for the open conjecture whether innermost joinability of all critical pairs ensures confluence of innermost terminating term rewriting systems. We then show that innermost joinability of all normalized instances of ...
Confluent term rewriting systems
RTA'05: Proceedings of the 16th international conference on Term Rewriting and ApplicationsThe confluence property is one of the most important properties of term rewriting systems, and various sufficient criteria for proving this property have been widely investigated. A necessary and sufficient criterion for confluence of terminating term ...
On the Regularity Condition for Vector Programming Problems
In this work, we use a notion of approximation derived from Jourani and Thibault [13] to ascertain optimality conditions analogous to those that established but applicable to larger class of vector valued objective mappings and constraint set-valued ...
Comments