Schnoebelen, Ph., Decomposable regular languages and the shue operator, EATCS Bull. (1999), pp. 283-289. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Unknown - Aceto Panangaden Eds (Correct)
....some # # # and # # ## and Post # for some # # # and # # ## where # # Act is a constraint on acceptable labels for reachability. Not all regular # # Act can be dealt with in this approach (see [17,16] but interesting regular constraints, called decomposable constraints, are allowed [21]. ##### ######## ### ##### ### Using Pre and standard constructs for intersection and complementation, one can compute for any formula # of the modal logic EF, the set Mod(#) of all terms that satisfy # (see [17,19] Here, EF can even be enriched with decomposable constraints. Note that ....
Schnoebelen, Ph., Decomposable regular languages and the shue operator, EATCS Bull. (1999), pp. 283-289.
Deciding Bisimulation-Like Equivalences with Finite-State.. - Jancar, Kucera, Mayr (1999) (10 citations) (Correct)
.... w) fwg interleave(w; fwg interleave(a 1 w 1 ; a 2 w 2 ) fa 1 w j w 2 interleave(w 1 ; a 2 w 2 )g [ fa 2 w j w 2 interleave(a 1 w 1 ; w 2 )g It is easy to see that the closure of a set of decomposable constraints under disjunction is again a set of decomposable constraints (see [19,32] for more on decomposable constraints and decomposable languages) All the previously mentioned examples of relations R can be expressed by decomposable constraints. Consider the relation W for weak bisimulation. There we have the following constraints: W (w) w = i for some i 2 N 0 ) 18 ....
Ph. Schnoebelen. Decomposable regular languages and the shue operator. EATCS Bulletin, 67:283289, February 1999.
On a conjecture of Schnoebelen - Gómez, Pin Self-citation (Schnoebelen) (Correct)
....concerning decomposable languages and establish some new properties of these languages. 1 Introduction The shu e product is a standard tool for modeling process algebras [2] This motivates the study of robust classes of recognizable languages which are closed under shu e product. In [6], Schnoebelen introduced the notion of sequential and parallel decomposition (a precise de nition is given in Section 3) A language is decomposable if it belongs to a nite set of languages S such that each member of S admits a sequential and parallel decomposition over S. Schnoebelen proved ....
....and parallel decomposition over S. Schnoebelen proved that the class of decomposable languages is a quite robust class of rational languages, since it is closed under nite union, product and shu e. It is a challenging question to nd an e ective characterization of this class of languages. In [6], Schnoebelen proved that a nite union of products of commutative languages are decomposable and conjectured there are no other decomposable languages. In this paper, we disprove this conjecture and establish some new properties of decomposable languages: they are closed under left and right ....
[Article contains additional citation context not shown here]
P. Schnoebelen, Decomposable regular languages and the shue operator, EATCS Bull. ,67 (1999), 283-289.
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