A. Gupta, A constructive proof that tree are well-quasi-ordered under minors (detailed abstract), in: Logical Foundations of Computer Science - Tver '92, Well-Orderings of Algebra and Kruskal's Theorem 41 A. Nerode, M. Taitslin eds., Tver, Russia, July 1992, Lecture Notes in Computer Science 620, (Springer, 1992) pp. 174--185. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Well-Orderings of Algebra and Kruskal's Theorem - Hasegawa (1993) (Correct)
....that the the reader might feel the argument is simpler and having an intention to provide a guide to more general arguments for mutual recursion. We also give a brief description for another result on finite trees, which already appeared in the literature but can be simplified by our method. In [18], Gupta proved that well partial orderedness of the tree minor relation is equivalent to well orderedness of the ordinal ffl 0 . The method in [18] is to associate regular expressions to trees and ordinals to regular expressions so that bad sequences with respect to the tree minor yield descending ....
....We also give a brief description for another result on finite trees, which already appeared in the literature but can be simplified by our method. In [18] Gupta proved that well partial orderedness of the tree minor relation is equivalent to well orderedness of the ordinal ffl 0 . The method in [18] is to associate regular expressions to trees and ordinals to regular expressions so that bad sequences with respect to the tree minor yield descending sequences of ordinals less than ffl 0 . A finite non ordered tree is a minor of another if and only if the former is obtained from the latter by ....
[Article contains additional citation context not shown here]
A. Gupta, A constructive proof that tree are well-quasi-ordered under minors (detailed abstract), in: Logical Foundations of Computer Science - Tver '92, Well-Orderings of Algebra and Kruskal's Theorem 41 A. Nerode, M. Taitslin eds., Tver, Russia, July 1992, Lecture Notes in Computer Science 620, (Springer, 1992) pp. 174--185.
Linear Time Algorithm Generation based on Well-Quasi-Orders - An.. - Ogawa (2000) (Correct)
....on effectively computing the finite congruence. We adopted the constructive proof of Higman s lemma [11] for query processing in indefinite databases [22] The next step may be to use the constructive proof of Kruskal s theorem [12] Gupta demonstrated the constructive proof of the weaker form [8]. In both cases, proofs are closely related to regular expressions. Ref. 4] asserts that a regular set of words is an upward closed set wrt a WQO and vice versa. This may give insight into this relationship. 7 Conclusion This paper described an automatic linear time algorithm generation for ....
A. Gupta. A constructive proof that tree are wellquasi -ordered under minors. In A. Nerode and M. Taitslin, editors, Logical foundations of computer science - Tver'92, pages 174--185, 1992. Lecture Notes in Computer Science, Vol. 620, Springer-Verlag.
Regularity for Omega-Languages Based on Well-Quasi-Orders - Ogawa (Correct)
.... restricting a WQO to the embedding (or minor) relation on finite structures, similar relationship in constructive way is found in literatures, such as for finite words and trees, the constructive proof of Higman s lemma and Kruskal s theorem are given based on suitable regular expressions [MR90, Gup92]. for finite graphs (with bounded tree width) the existence of forbidden minors, finite congruence, reduction system (which corresponds to finite automata) and monadic second order formula are equivalent[FL89, LA91] Then, the natural question is whether the connection between regularity and ....
A. Gupta. A constructive proof that tree are well-quasi-ordered under minors (detailed abstract). In Proc. LFCS '92, pp. 174--185, 1992. LNCS 620.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC