L. Ilie and A. Salomaa. On well quasi orders of free monoids. Theor. Comput. Sci., 204:131--152, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Decidability of the Generalized Confluence Problem for.. - Ilie (1997) Self-citation (Ilie) (Correct)
....order, than each of the former two. As shown in [HI] the decidability of the confluence problem is closely related to the effective regularity of downsets, where the down set of a language is the set of all words smaller than the words in the language. The confluence property was generalized in [IS] by considering languages which are finite unions of confluent languages. It was shown there that the generalized confluence property is closely related to the property of a quasi order of being a well quasi order. We study in this paper the decidability of the generalized confluence problem with ....
....and the family F pref . It generalizes the following result in [HI] Lemma 3.1 ( HI] Any language L Sigma is in the family F pref if and only if the following conditions are fulfilled: i) L is infinite, ii) L =#p L, iii) L is confluent w.r.t. p . We need also the next result from [IS]. It was proved first for k = 1 in [HI] Lemma 3.2 ( IS] For any quasi order on Sigma and k 1, a language L Sigma is k confluent w.r.t. if and only if # L is k confluent w.r.t. Lemma 3.3. Let k 1 and L Sigma an infinite language such that L =#p L. Then L is ....
[Article contains additional citation context not shown here]
L. Ilie, A. Salomaa, On well quasi orders of free monoids, submitted.
Trajectory-Based Codes - Domaratzki (2004) (Correct)
No context found.
L. Ilie and A. Salomaa. On well quasi orders of free monoids. Theor. Comput. Sci., 204:131--152, 1998.
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