A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Ternary directed acyclic word graphs

2004
*
Theoretical Computer Science
*

The

doi:10.1016/j.tcs.2004.07.008
fatcat:jsyudojjzvgylgd5xadf64p4pi
*directed**acyclic**word**graph*(DAWG) of a string w is the smallest DFA that accepts all suffixes of w, and requires only linear space. ... We apply the scheme of*ternary*trees to DAWGs, introducing a new data structure named*ternary*DAWGs (TDAWGs). ...*Ternary*-*directed**acyclic**word**graphs*In this section, we present a new kind of automata called*ternary**directed**acyclic**word**graphs*(TDAWGs). ...##
###
Ternary Directed Acyclic Word Graphs
[chapter]

2003
*
Lecture Notes in Computer Science
*

The

doi:10.1007/3-540-45089-0_12
fatcat:thng2buzozhxdfnyyadc3icdxy
*directed**acyclic**word**graph*(DAWG) of a string w is the smallest DFA that accepts all suffixes of w, and requires only linear space. ... We apply the scheme of*ternary*trees to DAWGs, introducing a new data structure named*ternary*DAWGs (TDAWGs). ... Conclusions and Further Work In this paper we introduced a new data structure called*ternary**directed**acyclic**word**graphs*(TDAWGs). ...##
###
The rotor–router model on regular trees

2009
*
Journal of combinatorial theory. Series A
*

Further, we characterize the possible "escape sequences" for the

doi:10.1016/j.jcta.2008.05.012
fatcat:yz6exhisx5hb7ixjzdq5xx7aba
*ternary*tree, that is, binary*words*a_1 ... a_n for which there exists a rotor configuration so that the k-th chip escapes to infinity if ... This is proved by defining the rotor-router group of a*graph*, which we show is isomorphic to the sandpile group. ... be a finite*directed**graph*without loops. ...##
###
Page 6750 of Mathematical Reviews Vol. , Issue 2004i
[page]

2004
*
Mathematical Reviews
*

The author investigates some types of

*acyclic*, reflexive and tran- sitive binary relations. ... We prove a result that extends the absolute bound for strongly regular*graphs*, and we give a characterization of*directed*strongly regular*graphs*whose adjacency matrix has rank 3 or 4. ...##
###
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach
[article]

2019
*
arXiv
*
pre-print

Also, we tackle geometrically the WMG-solvability of finite,

arXiv:1911.00474v1
fatcat:q5eqexuwjnblfhfwdislozilru
*acyclic*LTS with any number of labels. ... Additional constraints are investigated: when the LTS is either finite or infinite, and either cyclic or*acyclic*. ... Then, leaving out the restriction on the number of labels, we developed a geometric characterisation for*acyclic*LTS, using convex sets and the theory of regions; in the case circular LTS, we proposed ...##
###
N-ary Relation Extraction using Graph-State LSTM

2018
*
Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing
*

We propose a

doi:10.18653/v1/d18-1246
dblp:conf/emnlp/SongZWG18
fatcat:k2x6i3ws3zcb5ouadnkrh2jati
*graph*-state LSTM model, which uses a parallel state to model each*word*, recurrently enriching state values via message passing. ... Compared with DAG LSTMs, our*graph*LSTM keeps the original*graph*structure, and speeds up computation by allowing more parallelization. ... To calculate a hidden state encoding for each*word*, Peng et al. (2017) first split the input*graph*into two*directed**acyclic**graphs*(DAGs) by separating left-to-right edges from right-to-left edges ...##
###
N-ary Relation Extraction using Graph State LSTM
[article]

2018
*
arXiv
*
pre-print

We propose a

arXiv:1808.09101v1
fatcat:ffg4ivkjsbcebo6j6ge264gqie
*graph*-state LSTM model, which uses a parallel state to model each*word*, recurrently enriching state values via message passing. ... Compared with DAG LSTMs, our*graph*LSTM keeps the original*graph*structure, and speeds up computation by allowing more parallelization. ... To calculate a hidden state encoding for each*word*, Peng et al. (2017) first split the input*graph*into two*directed**acyclic**graphs*(DAGs) by separating left-to-right edges from right-to-left edges ...##
###
Graph grammars for self assembling robotic systems

2004
*
IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004
*

In particular, to generate an

doi:10.1109/robot.2004.1302558
dblp:conf/icra/KlavinsGL04
fatcat:72qlx3do25cn7knm7thniul2dy
*acyclic**graph*we synthesize a binary grammar (rules involve at most two parts), and for a general*graph*we synthesize a*ternary*grammar (rules involve at most three parts) ... In this paper we define a class of*graph*grammars that can be used to model and*direct*distributed robotic assembly or formation forming processes. ... In other*words*, at all times we have S (Φ) = {(V, E S )}. The triangulation proceeds as follows. ...##
###
Chip-Firing and Rotor-Routing on $\mathbb{Z}^d$ and on Trees

2008
*
Discrete Mathematics & Theoretical Computer Science
*

International audience The sandpile group of a

doi:10.46298/dmtcs.3618
fatcat:fj5fk72i35cpldqj5nuv54jq3m
*graph*$G$ is an abelian group whose order is the number of spanning trees of $G$. ... In the regular tree, we use the sandpile group to prove that rotor-router aggregation started from an*acyclic*initial condition yields a perfect ball. ... Let G be a strongly connected finite*directed**graph*without loops. Fix a sink vertex s in G. ...##
###
Cross-Sentence N-ary Relation Extraction with Graph LSTMs

2017
*
Transactions of the Association for Computational Linguistics
*

In this paper, we explore a general relation extraction framework based on

doi:10.1162/tacl_a_00049
fatcat:ey7qk2gwqrebjkzpifjmqjvfq4
*graph*long short-term memory networks (*graph*LSTMs) that can be easily extended to cross-sentence n-ary relation extraction. ... The*graph*formulation provides a unified way of exploring different LSTM approaches and incorporating various intra-sentential and intersentential dependencies, such as sequential, syntactic, and discourse ... The document*graph*(top) is partitioned into two*directed**acyclic**graphs*(bottom); the*graph*LSTMs is constructed by a forward pass (Left to Right) followed by a backward pass (Right to Left). ...##
###
Cross-Sentence N-ary Relation Extraction with Graph LSTMs
[article]

2017
*
arXiv
*
pre-print

In this paper, we explore a general relation extraction framework based on

arXiv:1708.03743v1
fatcat:2cmd6mtg5neq3gexu5fet5pkya
*graph*long short-term memory networks (*graph*LSTMs) that can be easily extended to cross-sentence n-ary relation extraction. ... The*graph*formulation provides a unified way of exploring different LSTM approaches and incorporating various intra-sentential and inter-sentential dependencies, such as sequential, syntactic, and discourse ... The document*graph*(top) is partitioned into two*directed**acyclic**graphs*(bottom); the*graph*LSTMs is constructed by a forward pass (Left to Right) followed by a backward pass (Right to Left). ...##
###
Graph Logics with Rational Relations and the Generalized Intersection Problem

2012
*
2012 27th Annual IEEE Symposium on Logic in Computer Science
*

We investigate some basic questions about the interaction of regular and rational relations on

doi:10.1109/lics.2012.23
dblp:conf/lics/BarceloFL12
fatcat:wnixhv57lfat5f5ccz3ll7ir74
*words*. ... The primary motivation comes from the study of logics for querying*graph*topology, which have recently found numerous applications. ... = ∅ is decidable in NEXPTIME if I is a*directed**acyclic**graph*. • There is a relation I with a*directed*cycle and S ∈ SCR such that (REC ∩ I S) ? = ∅ is undecidable. ...##
###
Transversal structures on triangulations: a combinatorial study and straight-line drawings
[article]

2008
*
arXiv
*
pre-print

This article focuses on a combinatorial structure specific to triangulated plane

arXiv:math/0602163v4
fatcat:jcsdsztudretnjaqsyevdkr57y
*graphs*with quadrangular outer face and no separating triangle, which are called irreducible triangulations. ... The main results obtained in the article are a bijection between irreducible triangulations and*ternary*trees, and a straight-line drawing algorithm for irreducible triangulations. ... A well-known result of*graph*theory ensures that an*acyclic**graph*H having n − 1 edges and covering a subset of an n-vertex set V is a tree covering exactly all vertices of V . ...##
###
Page 1254 of Mathematical Reviews Vol. , Issue 99b
[page]

1991
*
Mathematical Reviews
*

Renaud Vérin, On compact

*directed**acyclic**word**graphs*(192-211); David Haus- sler and Manfred Opper, Metric entropy and minimax risk in classification (212-235); Alberto Apostolico and Dany Breslauer, ... , Ehrenfeucht games, the composition method, and the monadic theory of ordinal*words*(118-143); Roderick Bloem and Joost Engelfriet, Monadic second order logic and node rela- tions on*graphs*and trees ...##
###
Algebraic approach to locally finite trees with one end

2003
*
Mathematica Bohemica
*

A = (A, f ) , B = (B, g) be two connected

doi:10.21136/mb.2003.133934
fatcat:37cxg3n54zb73cg2shkkzqdrni
*acyclic*monounary algebras. Then the*direct*product A × B is also a connected*acyclic*monounary algebra. Proposition 2. Let Now we prove another theorem. ... We consider infinite undirected trees and*directed*trees obtained from them. The concept of an end of an infinite locally finite*graph*was introduced by R. Halin [1] . ...
« Previous

*Showing results 1 — 15 out of 1,532 results*