Filters








15,715 Hits in 3.0 sec

The equivalence and inclusion problems for NTS languages

G. Senizergues
1985 Journal of computer and system sciences (Print)  
To establish our result we first reduce the equivalence problem to the word problem for the syntactic congruence of an NTS language.  ...  They are determimstic and congruential [3, 4] . Our first result here is that the equivalence problem is decidable for NTS grammars.'  ...  ACKNOWLEDGMENTS The results presented here are part of a third cycle thesis [ 161. I should like to than by thesis advisor L. Boasson and also J. M. Autebert for many suggestions and discussions.  ... 
doi:10.1016/0022-0000(85)90055-8 fatcat:ut4hl7x53zdo5ifgwpewhpbu3u

Page 1063 of Mathematical Reviews Vol. , Issue 88b [page]

1988 Mathematical Reviews  
{See also the following review. } Yasuyoshi Inagaki (Nagoya) 88b:68100 68Q45 03D05 03D35 Sénizergues, G. (F-PARIS7) The equivalence and inclusion problems for NTS languages. J. Comput.  ...  The third result is that the inclusion problem is undecidable for NTS languages. Yasuyoshi Inagaki (Nagoya) 88b:68101 68Q45 03D05 68Q05 Brandenburg, Franz-J.  ... 

Decision problems for Clark-congruential languages [article]

Makoto Kanazawa, Tobias Kappé
2018 arXiv   pre-print
We also consider the problem of checking whether a given CFG is Clark-congruential, and show that it is decidable given that the CFG is a DCFG.  ...  We answer this question positively for the class of Clark-congruential grammars, which are of interest to grammatical inference.  ...  Acknowledgements We would like to thank the anonymous referees of LearnAut and ICGI for their comments, which helped improve this paper.  ... 
arXiv:1805.04402v2 fatcat:zpykighi3jbmhctyztyvhd2pum

The inclusion problem for some subclasses of context-free languages

Peter R.J. Asveld, Anton Nijholt
2000 Theoretical Computer Science  
Then the inclusion or containment problem for (D 1 ; D 2 ) is the question whether for arbitrary D 1 ∈ D 1 and D 2 ∈ D 2 the inclusion L(D 1 ) ⊆ L(D 2 ) holds.  ...  In case D 1 = D 2 we refer to this problem as the inclusion problem for D 1 .  ...  Acknowledgements We are indebted to Rieks op den Akker and Jan Anne Hogendorp for some remarks on an earlier version of this note.  ... 
doi:10.1016/s0304-3975(99)00113-9 fatcat:6236w3qpxfgynffdd34bpuwsxm

Checking the realizability of BPMN 2.0 choreographies

Pascal Poizat, Gwen Salaün
2012 Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12  
Our approach is formally grounded on a model transformation into the LO-TOS NT process algebra and the use of equivalence checking.  ...  While being a standard for the abstract specification of business workflows and collaboration between services, the Business Process Modeling Notation (BPMN) has only been recently extended into BPMN 2.0  ...  This work is supported by the Personal Information Management through Internet project (PIMI-ANR-2010-VERS-0014-03) of the French National Agency for Research.  ... 
doi:10.1145/2245276.2232095 dblp:conf/sac/PoizatS12 fatcat:zxogdbz6cjhl3e5le2lojv2vv4

Undecidability of the equivalence of finite substitutions on regular language

Vesa Halava, Tero Harju
1999 RAIRO - Theoretical Informatics and Applications  
A simpli ed proof is given for the following result due to L. Lisovik: It is undecidable for two given " free nite substitutions, whether they are equivalent on the regular language bf0; 1g c.  ...  The equivalence problem In this section we shall prove that the equivalence problem of nite substitutions is undecidable for the regular language b f0; 1g c.  ...  For example, for nite pre x substitutions the equivalence problem on regular language is known to be decidable, see Karhum ki 2].  ... 
doi:10.1051/ita:1999109 fatcat:qgm2wstov5fvpa5qyiq2s2p3ei

Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages

G. Sénizergues
1989 Information and Computation  
For left-basic semi-Thue systems see Sakarovitch, 1979.) 1II.A THE EXTENDED EQUIVALENCE PROBLEM FOR NTS LANGUAGES We show here that Eq(NTS, CR) is decidable. Hence Eq(NTS, D) is decidable.  ...  We recall that NTS languages are deterministic (Boasson, 1980; Boasson and Senizergues, 1985) and have a decidable equivalence problem (Sen 1,2).  ... 
doi:10.1016/0890-5401(89)90032-1 fatcat:6sm6qgvagfevnfafu5w677w6yy

NTS languages are deterministic and congruential

L. Boasson, G. Senizergues
1985 Journal of computer and system sciences (Print)  
Moreover, we show that this family of languages is closed under reversal and intersection with regular sets. A forthcoming paper will prove that, for this class, the equivalence problem is decidable.  ...  A context-free grammar is said to be NTS if the set of sentential forms it generates is unchanged when the rules are used both ways.  ...  This remark shows that the decidability of the equivalence problem for NTS languages cannot be considered as a special case of the result on real-time deterministic pda's [ 123. COROLLARY.  ... 
doi:10.1016/0022-0000(85)90056-x fatcat:zjftvpchn5fgjc7dcml6wskemi

Decidability and density in two-symbol grammar forms

H.A. Maurer, A. Salomaa, D. Wood
1981 Discrete Applied Mathematics  
It is proved that form equivalence is decidable for context-free grammar forms with only one nonterminal and one terminal symbol.  ...  The results obtained are applied also to L forms.  ...  By Lemmas 6 and 7, G, and Gz are form equivalent if and only if, for each NT production S + akSa' of G, the pair is not dense. G is constructed by way of Lemma 7.  ... 
doi:10.1016/0166-218x(81)90006-8 fatcat:q3bo3obkm5fv7acdqtrgqs46cq

CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes [chapter]

Hubert Garavel, Frédéric Lang, Radu Mateescu, Wendelin Serwe
2011 Lecture Notes in Computer Science  
The paper then reviews the main features of Cadp 2010, including compilers for various formal specification languages, equivalence checkers, model checkers, performance evaluation tools, and parallel verification  ...  The paper first describes the theoretical principles and the modular architecture of Cadp, which has inspired several other recent model checkers.  ...  -Relying on action-based models enables equivalence checking, i.e., the comparison of specifications for equality or inclusion; this corresponds to the notions of bisimulations for Ltss and aggregation  ... 
doi:10.1007/978-3-642-19835-9_33 fatcat:4fh2thknsfaergm37j6tgbncze

Page 2270 of Mathematical Reviews Vol. , Issue 94d [page]

1994 Mathematical Reviews  
For normed finite processes the last inclusion is satisfied by equality, and for locally unary processes the last but one inclusion is satisfied by equality.  ...  The isomorphism problem for fi- nite initiated PLTSs is shown to be equivalent to the isomorphism problem for finite undirected graphs (Section 5).  ... 

Thesaurus and Heading Lists: Equivalences and Divegences [chapter]

Pino Buizza
2020 Knowledge Organization at the Interface  
Some typical examples of mapping are reported, showing the equivalences and the most frequent divergences between the semantic networks and giving the starting point for justifying the divergences on the  ...  Aim and background The great variety of indexing systems, together with the use of different languages, meets the specific needs of their patrons.  ...  These mismatches can be due to language differences, different context and literary warrant, or different structure and application criteria of the considered indexing languages (for instance, the inclusion  ... 
doi:10.5771/9783956507762-59 fatcat:ghgy6vksebcrnjazbeqhlxpx6q

Some modifications of auxiliary pushdown automata

G. Buntrock, F. Drewes, C. Lautemann, T. Mossakowski
1991 RAIRO - Theoretical Informatics and Applications  
ACKNOWLEDGEMENTS We thank Birgit Jenner and Bernd Kirsig for pointing out to us and discussing with us the notions of "begin" and "end" nondeterminism.  ...  EQUIVALENCES BETWEEN OPEN PROBLEMS In the previous section, we have shown some of the inclusions in figure 1 to be proper, while properness of the other ones remains an open problem.  ...  D 4. 4 .Figure 2 . 42 THEOREM: The five diamonds in figure 2 are equivalent in the following sensé: For any two diamonds, each inclusion in the first one is an equalily if and only if the corresponding  ... 
doi:10.1051/ita/1991250605451 fatcat:2uueqe4bivc6xenujsak6yjnlq

CADP 2011: a toolbox for the construction and analysis of distributed processes

Hubert Garavel, Frédéric Lang, Radu Mateescu, Wendelin Serwe
2012 International Journal on Software Tools for Technology Transfer (STTT)  
The paper then reviews the main features of Cadp 2011, including compilers for various formal specification languages, equivalence checkers, model checkers, compositional verification tools, performance  ...  The paper first describes the theoretical principles and the modular architecture of Cadp, which has inspired several other recent model checkers.  ...  -Relying on action-based models enables equivalence checking, i.e., the comparison of specifications for equality or inclusion; this corresponds to the notions of bisimulations for Ltss and aggregation  ... 
doi:10.1007/s10009-012-0244-z fatcat:fdch5egwpneebjd3bo6lozyhby

Page 1667 of Mathematical Reviews Vol. , Issue 83d [page]

1983 Mathematical Reviews  
A context-free grammar G=(V,=, P) is said to be nonterminal separated (NTS) if for all A € V and all yeE(VUZ)* the following condition holds: A >* y if and only if A=* y.  ...  NTS grammars and Church- Rosser systems. Inform. Process. Lett. 13 (1981), no. 2, 73-76. This brief paper contributes to the relation of confluent Thue systems and NTS grammars.  ... 
« Previous Showing results 1 — 15 out of 15,715 results