Filters








3,583 Hits in 4.6 sec

The Suffix Tree of a Tree and Minimizing Sequential Transducers

Dany Breslauer
<span title="1995-06-17">1995</span> <i title="Aarhus University Library"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/433eg2tipzegfkgt5m5cmv46zq" style="color: black;">BRICS Report Series</a> </i> &nbsp;
The suffix tree of a tree is used to obtain an efficient<br />algorithm for the minimization of sequential transducers.  ...  This paper gives a linear-time algorithm for the construction of the<br />suffix tree of a tree.  ...  Then, the CS-tree can be modified to represent the encoded alphabet strings, the suffix tree is built for the modified CS-tree (whose size is at most n log |Σ|), and the suffix tree is modified to represent  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v2i47.19948">doi:10.7146/brics.v2i47.19948</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5biqc4tmovaczhp3yzcli3gscm">fatcat:5biqc4tmovaczhp3yzcli3gscm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720063925/https://tidsskrift.dk/brics/article/download/19948/17601" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b6/15/b61520a6b0336d42ad2b64aa314c2f0a6f5157a0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v2i47.19948"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

The suffix tree of a tree and minimizing sequential transducers

Dany Breslauer
<span title="">1998</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
The suffix tree of a tree is used to obtain an efficient algorithm for the minimization of sequential transducers. *  ...  This paper gives a linear-time algorithm for the construction of the suffix tree of a tree, which was introduced by Kosaraju, as a natural generalization of the suffix tree of a string.  ...  Then, the CS-tree can be modified to represent the encoded alphabet strings, the suffix tree is built for the modified CS-tree (whose size is at most n log (Z] ), and the suffix tree is modified to represent  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(96)00319-2">doi:10.1016/s0304-3975(96)00319-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sy7et6gqubbk3okyay4z4qwcki">fatcat:sy7et6gqubbk3okyay4z4qwcki</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171001153852/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/a5f/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzU5NjAwMzE5Mg%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f8/96/f8967469df71ba7517d2cda638cf83de4f80f4c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(96)00319-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

The suffix tree of a tree and minimizing sequential transducers [chapter]

Dany Breslauer
<span title="">1996</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The suffix tree of a tree is used to obtain an efficient algorithm for the minimization of sequential transducers. *  ...  This paper gives a linear-time algorithm for the construction of the suffix tree of a tree, which was introduced by Kosaraju, as a natural generalization of the suffix tree of a string.  ...  Then, the CS-tree can be modified to represent the encoded alphabet strings, the suffix tree is built for the modified CS-tree (whose size is at most n log (Z] ), and the suffix tree is modified to represent  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-61258-0_10">doi:10.1007/3-540-61258-0_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ijqktfyqdncxfpr6bsvzhwku7i">fatcat:ijqktfyqdncxfpr6bsvzhwku7i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171001153852/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/a5f/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzU5NjAwMzE5Mg%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f8/96/f8967469df71ba7517d2cda638cf83de4f80f4c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-61258-0_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Equivalence Problems for Tree Transducers: A Brief Survey

Sebastian Maneth
<span title="2014-05-21">2014</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzezkwolyvf33pglm2jldjklca" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
The decidability of equivalence for three important classes of tree transducers is discussed.  ...  For the full class of MTTs, decidability of equivalence remains a long-standing open problem.  ...  For the transducers that map strings to nested strings, that is, for streaming string-to-tree transducers their construction yields a PSPACE bound (Theorem 21 of [3] ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.151.5">doi:10.4204/eptcs.151.5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bso3z5x5tjgy5fnx5anekyudei">fatcat:bso3z5x5tjgy5fnx5anekyudei</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190303204630/http://pdfs.semanticscholar.org/bb7e/f60aa16364443bd965cd80a6f3215621b274.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bb/7e/bb7ef60aa16364443bd965cd80a6f3215621b274.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.151.5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

A Survey on Decidable Equivalence Problems for Tree Transducers

Sebastian Maneth
<span title="">2015</span> <i title="World Scientific Pub Co Pte Lt"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yhcgkcmjlvfovferf3in5mkmpq" style="color: black;">International Journal of Foundations of Computer Science</a> </i> &nbsp;
3 to-string translations obtained by string transducers with copying.  ...  tree transducers, and (3) monadic input and output ranked alphabets.  ...  Acknowledgements I wish to thank Joost Engelfriet and the anonymous referee for many helpful comments on a previous version of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0129054115400134">doi:10.1142/s0129054115400134</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5wxybcc6xjbvdg43rgst5c4r5a">fatcat:5wxybcc6xjbvdg43rgst5c4r5a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190307084344/http://pdfs.semanticscholar.org/d3f8/8965d9a06c376b7c27a888ed09dbc5e729f0.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d3/f8/d3f88965d9a06c376b7c27a888ed09dbc5e729f0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0129054115400134"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers,

Frank Drewes
<span title="">2001</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
The exponential output size problem is to determine whether the size of output trees of a tree transducer grows exponentially in the size of input trees.  ...  It is shown to be NL-complete for total top-down tree transducers, DEXPTIME-complete for general top-down tree transducers, and P-complete for bottom-up tree transducers.  ...  Acknowledgement I thank Joost Engelfriet, who told me where to nd the completeness results in 11] and pointed out the related work in 1], as well as Helmut Seidl and an anonymous referee for their careful  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/inco.2001.3039">doi:10.1006/inco.2001.3039</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s5kotcdcjngorfsyfzxktvbnru">fatcat:s5kotcdcjngorfsyfzxktvbnru</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190304094812/http://pdfs.semanticscholar.org/c47a/cc89bc0d0da85d8d3b611f861e0230f5b366.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c4/7a/c47acc89bc0d0da85d8d3b611f861e0230f5b366.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/inco.2001.3039"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Decision problems of tree transducers with origin

Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot
<span title="">2018</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
A tree transducer with origin translates an input tree into a pair of output tree and origin info. The origin info maps each node in the output tree to the unique input node that created it.  ...  The equivalence of deterministic topdown tree-to-string transducers is decidable with origin, while without origin it is a long standing open problem.  ...  Hence, the problem reduces to letter-to-letter transducers [1] . What about nondeterministic top-down tree-to-string transducers (column four in Table 1 )?  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2018.02.011">doi:10.1016/j.ic.2018.02.011</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/umcrctauyzd6xgqyb2jfsse3ba">fatcat:umcrctauyzd6xgqyb2jfsse3ba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719000844/https://www.research.ed.ac.uk/portal/files/21938855/Filiot_et_al_2015_Decision_Problems_of_Tree.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a7/87/a7873d5ffadeac0f2b16a787b67dde506a631a0d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2018.02.011"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Decision Problems of Tree Transducers with Origin [chapter]

Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot
<span title="">2015</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
A tree transducer with origin translates an input tree into a pair of output tree and origin info. The origin info maps each node in the output tree to the unique input node that created it.  ...  The equivalence of deterministic topdown tree-to-string transducers is decidable with origin, while without origin it is a long standing open problem.  ...  Hence, the problem reduces to letter-to-letter transducers [1] . What about nondeterministic top-down tree-to-string transducers (column four in Table 1 )?  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-47666-6_17">doi:10.1007/978-3-662-47666-6_17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bpl3ttlxmzdpxmbbpes3i6fiwm">fatcat:bpl3ttlxmzdpxmbbpes3i6fiwm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719000844/https://www.research.ed.ac.uk/portal/files/21938855/Filiot_et_al_2015_Decision_Problems_of_Tree.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a7/87/a7873d5ffadeac0f2b16a787b67dde506a631a0d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-47666-6_17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable [article]

Joost Engelfriet, Sebastian Maneth
<span title="2005-06-06">2005</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
It is decidable for deterministic MSO definable graph-to-string or graph-to-tree transducers whether they are equivalent on a context-free set of graphs.  ...  Note that a tree transducer is of linear size increase if the size of the output tree is at most linear in the size of the input tree. Corollary 10.  ...  The equivalence problem is decidable (1) for single-use restricted attributed tree transducers and (2) for deterministic macro tree transducers of linear size increase.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0506014v1">arXiv:cs/0506014v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4v32upvcxbcpdhr3zewaxvuy3a">fatcat:4v32upvcxbcpdhr3zewaxvuy3a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171008211802/https://core.ac.uk/download/pdf/2420836.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f3/f3/f3f33b7ce43924887f4dfc6011c6d695e29374a7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0506014v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Training Tree Transducers

Jonathan Graehl, Kevin Knight, Jonathan May
<span title="">2008</span> <i title="MIT Press - Journals"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/e4yflo6sufcufjwloald7xudm4" style="color: black;">Computational Linguistics</a> </i> &nbsp;
We motivate the use of tree transducers for natural language and address the training problem for probabilistic tree-to-tree and tree-to-string transducers.  ...  Tree-based modeling still lacks many of the standard tools taken for granted in (finite-state) string-based modeling.  ...  and space, where n is the size of the input tree and m is the size of the output string.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1162/coli.2008.07-051-r2-03-57">doi:10.1162/coli.2008.07-051-r2-03-57</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iig3cyx6ybg57hb6awrnkv5uzm">fatcat:iig3cyx6ybg57hb6awrnkv5uzm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160330201941/http://www.aclweb.org:80/anthology/J08-3004" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7b/18/7b182bc94b6a12399961914f476f458387f9ffba.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1162/coli.2008.07-051-r2-03-57"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mitpressjournals.org </button> </a>

On the complexity of typechecking top-down XML transformations

Wim Martens, Frank Neven
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
We investigate the typechecking problem for XML transformations: statically verifying that every answer to a transformation conforms to a given output schema, for inputs satisfying a given input schema  ...  We parameterize the problem by several restrictions on the transformations (deleting, non-deleting, bounded width) and consider both tree automata and DTDs as input and output schemas.  ...  The size of the input of the typechecking problem is the sum of the sizes of the input and output schema and the tree transducer.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2004.10.035">doi:10.1016/j.tcs.2004.10.035</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nbbnmokbczcpfdbsoqb5fxsk4y">fatcat:nbbnmokbczcpfdbsoqb5fxsk4y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190414130309/https://core.ac.uk/download/pdf/81938321.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c5/17/c51763b5b057a29a3ece5a4c1d0a0c118ef8e80e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2004.10.035"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Typechecking Top-Down Uniform Unranked Tree Transducers [chapter]

Wim Martens, Frank Neven
<span title="2002-12-16">2002</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input schema.  ...  We parameterize the problem by several restrictions on the transformations (deleting, non-deleting, bounded width) and consider both tree automata and DTDs as output schemas.  ...  The size of the input of the typechecking problem is the sum of the sizes of the input and output schema and the tree transducer.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-36285-1_5">doi:10.1007/3-540-36285-1_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tqikbk5yrrdsxl6g7ow44ejtgy">fatcat:tqikbk5yrrdsxl6g7ow44ejtgy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808060659/https://doclib.uhasselt.be/dspace/bitstream/1942/611/1/30%20tc.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8d/92/8d92f42088c0304396ae2bb6dadc53375f05f6e4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-36285-1_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Typechecking top-down XML transformations: Fixed input or output schemas

Wim Martens, Frank Neven, Marc Gyssens
<span title="">2008</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
In this general setting, both the input and output schema as well as the transformation are part of the input for the problem.  ...  Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type.  ...  Acknowledgments We thank Giorgio Ghelli for raising the question about the complexity of typechecking in the setting of a fixed output schema.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2008.01.002">doi:10.1016/j.ic.2008.01.002</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/onmro2rudfh6hguss5hlzt3ici">fatcat:onmro2rudfh6hguss5hlzt3ici</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190417035234/https://core.ac.uk/download/pdf/82700250.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e7/96/e7968e29c68a94a1857b6632fd84deb4ce8ed152.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2008.01.002"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Large Scale Inference of Deterministic Transductions: Tenjinno Problem 1 [chapter]

Alexander Clark
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We discuss the problem of large scale grammatical inference in the context of the Tenjinno competition, with reference to the inference of deterministic finite state transducers, and discuss the design  ...  Though the OSTIA algorithm has good asymptotic guarantees for this class of problems, the amount of data required is prohibitive.  ...  Acknowledgements I would like to thank the organisers of the Tenjinno competition.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11872436_19">doi:10.1007/11872436_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/durbg4hmk5axbmemjb6wtvpm7y">fatcat:durbg4hmk5axbmemjb6wtvpm7y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808211504/http://www.cs.rhul.ac.uk/home/alexc/papers/42010227.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/43/47/4347f563319695d7212671926c63f9b6fb562857.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11872436_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Formal Methods of Transformations (Dagstuhl Seminar 17142)

Emmanuel Filiot, Sebastian Maneth, Helmut Seidl, Marc Herbstritt
<span title="2017-12-21">2017</span> <i title="Schloss Dagstuhl Leibniz-Zentrum für Informatik GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/u2phfyhrhje7xnnubtp3vfklcu" style="color: black;">Dagstuhl Reports</a> </i> &nbsp;
The goal of this Dagstuhl seminar was to gather researchers working on the theory and practice of transformations (also know as transductions) of word and tree structures, which are realised by transducers  ...  (automata with outputs).  ...  Adrien Boiret then addressed the problem of checking equivalence for symbolic top-down tree transducers.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.7.4.23">doi:10.4230/dagrep.7.4.23</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/dagstuhl-reports/FiliotMS17.html">dblp:journals/dagstuhl-reports/FiliotMS17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2kwm6o7h2banfjp5y5nb4wimvm">fatcat:2kwm6o7h2banfjp5y5nb4wimvm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220123034405/https://drops.dagstuhl.de/opus/volltexte/2017/7546/pdf/dagrep_v007_i004_p023_s17142.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/59/09/59097236719e52b3ffb8ab01b1998cdda116d1cf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/dagrep.7.4.23"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 3,583 results