T. Harju and L. Ilie. On quasi orders of words and the confluence property. Theor. Comput. Sci., 200:205--224, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On Well Quasi Orders of Free Monoids - Ilie, Salomaa (1997) (1 citation) Self-citation (Ilie) (Correct)
....or not an arbitrary regular language results as a down set from an infinite or bi infinite word, whereas the same problem is undecidable for context free language. A quasi order being a well quasi order is connected to arbitrary languages being confluent. 1 Introduction The results of Higman, [Hi], and Haines, Ha] are often used in the theory of formal languages. For instance, let u s v denote that u is a (scattered) subword of v. Then any language L whatsoever contains only a finite number of words minimal with respect to the partial order s . Consequently, if we have a set S of words ....
....quasi orders f ; s , and P . In fact, this a particular case of a more general result: if a language L is a star language, L = L , then L is confluent w.r.t. any quasi order f . 3 Well quasi orders The concept of a well quasi order has been frequently discovered; see, for instance, ER] [Hi], Kr1] Ha] A complete account in this matter is given by [Kr2] The definitions we use here are from [CK] Let be a quasi order on Sigma . A set L Sigma is an antichain of if all elements in L are pairwise incomparable w.r.t. that is, for any u; v 2 L, neither u v nor v u. The ....
[Article contains additional citation context not shown here]
T. Harju, L. Ilie, On quasi orders of words and the confluence property, manuscript, 1996.
The Decidability of the Generalized Confluence Problem for.. - Ilie (1997) Self-citation (Ilie) (Correct)
....thus generalizing previuos results concerning the decidability of the ordinary confluence problem. 1 Introduction Starting from the property of the language of all factors of an infinite word to contain, for any two words of it, one which has the former two as factors, one introduced in [HI] the notion of confluence. Generally, for any quasi order on a free monoid, the confluence property is the property of a language to contain, for any two words of it, one which is bigger, with respect to the given quasi order, than each of the former two. As shown in [HI] the decidability of the ....
....factors, one introduced in [HI] the notion of confluence. Generally, for any quasi order on a free monoid, the confluence property is the property of a language to contain, for any two words of it, one which is bigger, with respect to the given quasi 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 ....
[Article contains additional citation context not shown here]
T. Harju, L. Ilie, On quasi orders of words and the confluence property, submitted.
Trajectory-Based Codes - Domaratzki (2004) (Correct)
No context found.
T. Harju and L. Ilie. On quasi orders of words and the confluence property. Theor. Comput. Sci., 200:205--224, 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