18 Hits in 3.3 sec

Page 6689 of Mathematical Reviews Vol. , Issue 94k [page]

1994 Mathematical Reviews  
“In this paper these five facets of hyperedge replacement beyond context-freeness, the first two of which are already known in the literature, are introduced, discussed, investigated and related to each  ...  {For the entire collection see MR 941:68008.} 68Q_ Theory of computing 94k:68124 94k:68121 68Q50 05C90 68Q45 68R10 Kreowski, Hans-Jorg (D-BRMN; Bremen) Five facets of hyperedge replacement beyond context-freeness  ... 

Page 5352 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
Konstantinidis, The hierarchy of codes (50-68); Hans-Jérg Kreowski, Five facets of hyperedge replacement beyond context- freeness (69-86); Robin Milner, An action structure for syn- chronous z-calculus  ...  from hyperedge replacement (181-193); P.  ... 

Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs

Tamás Kálmán, Alexander Postnikov
2017 Proceedings of the London Mathematical Society  
Regarding the hypergraph (V,E) induced by G, we prove that its interior polynomial is equivalent to the Ehrhart polynomial of Q, which in turn is equivalent to the h-vector of any triangulation of Q.  ...  It also implies that certain extremal coefficients in the Homfly polynomial of a special alternating link can be read off of an associated Floer homology group.  ...  This contradicts the cycle-freeness of Γ.  ... 
doi:10.1112/plms.12015 fatcat:6uofm2j7xrf3xbdoz7i4irvpfm

Compression with wildcards: All exact, or all minimal hitting sets [article]

Marcel Wild
2021 arXiv   pre-print
Our main objective is the COMPRESSED enumeration (based on wildcards) of all minimal hitting sets of general hypergraphs.  ...  It also supports parallelization and cut-off (i.e. restriction to all minimal hitting sets of cardinality at most m).  ...  The first five ρ 1,j lack E 1 , the middle five E 2 , and the last five E 3 . Among the three expansions we pick the one which presumably leads to the fewest further branchings.  ... 
arXiv:2008.08996v2 fatcat:ffbbj4xvxjes3fa73msf7cnth4

Page 1369 of Mathematical Reviews Vol. 26, Issue Index [page]

Mathematical Reviews  
., 94k:68120 Kelemenova, Alica see Csuhaj-Varju, Erzsébet, 94a:68079 Kreowski, Hans-Joérg Five facets of hyperedge replacement beyond context-freeness.  ...  (English summary) 94a:68078 — Context-free graph grammars: separating vertex replacement from hyperedge replace- ment.  ... 

Page 701 of Mathematical Reviews Vol. 26, Issue Index [page]

Mathematical Reviews  
(Juhani Karhumaki) 94j:68140 68Q42 (68R10) — Five facets of hyperedge replacement beyond context-freeness.  ...  701 1994 Kreowski, Hans-Jérg Parallel hyperedge replacement. (English summary) Lindenmayer systems, 271-282, Springer, Berlin, 1992.  ... 

Pre-Proceedings of the International Colloquium on Graph and Model Transformation – On the occasion of the 65th birthday of Hartmut Ehrig (GraMoT 2010) [article]

(:Unkn) Unknown, Technische Universität Berlin, Technische Universität Berlin, Claudia Ermel, Hartmut Ehrig, Fernando Orejas, Gabriele Taentzer
Finally, an integration of Petri nets and high-level replacement systems, known as reconfigurable Petri nets, is used in the third paper by K. Hoffmann, J.  ...  Equipped with this background, we are now able to address today's problems in computer science and beyond, build tools, design languages and algorithms for analysis, etc. while relying on solid foundations  ...  Acknowledgements: We want to thank Fabio Gadducci, Alberto Lluch Lafuente, Daniele Terreni and Liang Zhao for many interesting discussions and exchange of ideas regarding the graphical encoding of CaSPiS  ... 
doi:10.14279/depositonce-10237 fatcat:44oa7p3275fhpdl4k5kdjr7euy

Beyond perfection - on relaxations and superclasses [article]

Annegret Wagler, Universitäts- Und Landesbibliothek Sachsen-Anhalt, Martin-Luther Universität
singleton of G can be a root due to the claw-freeness of G).  ...  Facet descriptions of STAB(G). Padberg was, again, the first who studied imperfection in this context.  ...  This suggests that imp(G) = max{imp(G a )} (7.11) taken over all support graphs G a of nontrivial facets a T x ≤ 1 of STAB(G) (i.e., G a is the subgraph of G induced by all nodes i with a i = 0).  ... 
doi:10.25673/4745 fatcat:bq4cc4z57na6thsofc3yaqakgy

Restarting Tree Automata

Heiko Vogler
2007 Lecture Notes in Computer Science   unpublished
Moreover, Fujiyoshi [Fuj04b, Fuj05] has shown a similar result for linear context-free tree grammars that are monadic.  ...  work in form of a seminar lecture at the Charles University.  ...  The class L (lin-CFTG) and the family of tree languages generated by context-free hyperedge replacement graph grammars (T R(HR tr )) coincide. 1 T 1 S → A F(x 1 , x 2 ) → B(x 2 ) F(x 1 , x 2 ) → x 2 2  ... 

Dagstuhl Reports, Volume 5, Issue 3, March 2015, Complete Issue [article]

The following list is a first collection of such phenomena.  ...  -Formal Models of Graph Transformation in Natural Language Processing  ...  Parsing Hyperedge Replacement Languages One of the most important algorithmic tasks in connection with context-free graph grammars, such as hyperedge replacement grammars, is parsing.  ... 
doi:10.4230/dagrep.5.3 fatcat:frrv4bul5rhfhh3jo4hv5l5uoi

Plurality and Quantification in Graph Representation of Meaning [article]

Yu Cao
behaviors of indefinites.  ...  We define its model-theoretical interpretation in terms of graph traversal, where the relative scope of variables arises from their order of valuation.  ...  In Section 1.6.3, graphgluing is implemented as an operation known as parallel composition from hyperedge replacement (HR) algebra (Courcelle, 1993) .  ... 
doi:10.48550/arxiv.2112.06448 fatcat:ypb63tnha5e2biw2453uaud3ku

Plurality and quantification in graph representation of meaning

Yu Cao
We show that the model-theoretical interpretation of this language can be defined in terms of graph traversal, where the relative scope of variables arises from their order of valuation.  ...  The study of meaning is inseparable from that of semantic representation, as design efforts in the latter exert far-reaching implications for linguistics and related computation.  ...  In Section 1.6.3, graph-gluing is implemented as an operation known as parallel composition from hyperedge replacement (HR) algebra (Courcelle, 1993) .  ... 
doi:10.7282/t3-9yr5-0r26 fatcat:lzux5jx3xfenfni7lnen5kqmfy

Circuit Complexity [chapter]

2011 The Probabilistic Method  
Acknowledgments We are very grateful to all our students and colleagues who contributed to the creation of this second edition by joint research, helpful discussions and useful comments.  ...  We prove these results in a more general context later.  ...  Let be an upper bound on the size of all hyperedges (upper bound on the degree of the polynomial ).½ for all ¾ , replacing the term by É ¾ Ø . All other terms (where does not contain ) are deleted.  ... 
doi:10.1002/9780470277331.ch12 fatcat:hm7d426ycvezxfnv27o4ertg4e

Correct and Efficient Accelerator Programming (Dagstuhl Seminar 13142)

Bernadette Charron-Bost, Stepahn Merz, Andrey Rybalchenko, Josef Widder, Albert Cohen, Alastair Donaldson, Marieke Huisman, Joost-Pieter Katoen, Stephen Kobourov, Martin Nöllenburg, Monique, Sergiu Hart (+2 others)
2013 unpublished
I also survey the classical algorithms of Douglas and Peucker; Imai and Iri; and of Chan and Chin. Participants  ...  We implemented our parallel algorithms on top of the probabilistic model checker PRISM.  ...  auction replaces the second-price one.  ... 

Dagstuhl Reports, Volume 8, Issue 1, January 2018, Complete Issue [article]

Abstract We document the program and the immediate outcomes of Dagstuhl Seminar 18052 "Genetic Improvement of Software".  ...  Several talks covered the state-of-the-art and work in progress.  ...  five topics.  ... 
doi:10.4230/dagrep.8.1 fatcat:dv5ntjliznbs7dwohrcmiwr3lm
« Previous Showing results 1 — 15 out of 18 results