Article

Locating Matches of Tree Patterns in Forests

Authors:

Andreas Neumann,

Helmut SeidlAuthors Info & Claims

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science

Pages 134 - 145

Published: 17 December 1998 Publication History

Abstract

No abstract available.

Cited By

View all

Labath PNiehren J(2015)A Uniform Programmning Language for Implementing XML StandardsProceedings of the 41st International Conference on SOFSEM 2015: Theory and Practice of Computer Science - Volume 893910.1007/978-3-662-46078-8_45(543-554)Online publication date: 24-Jan-2015
https://dl.acm.org/doi/10.1007/978-3-662-46078-8_45
Pillwein VTakacs S(2014)A local Fourier convergence analysis of a multigrid method using symbolic computationJournal of Symbolic Computation10.1016/j.jsc.2013.12.00863(1-20)Online publication date: 1-May-2014
https://dl.acm.org/doi/10.1016/j.jsc.2013.12.008
Sankur OBouyer PMarkey N(2014)Shrinking timed automataInformation and Computation10.1016/j.ic.2014.01.002234(107-132)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1016/j.ic.2014.01.002
Show More Cited By

Locating Matches of Tree Patterns in Forests
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Exact Learning of Unordered Tree Patterns From Queries
On Exact Learning of Unordered Tree Patterns

Tree patterns are natural candidates for representing rules and hypotheses in many tasks such as information extraction and symbolic mathematics. A tree pattern is a tree with labeled nodes where some of the leaves may be labeled with variables, whereas ...
Exact learning of tree patterns

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science

December 1998

364 pages

ISBN:3540653848

Editors:
V. Arvind,
R. Ramanujam

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 17 December 1998

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Labath PNiehren J(2015)A Uniform Programmning Language for Implementing XML StandardsProceedings of the 41st International Conference on SOFSEM 2015: Theory and Practice of Computer Science - Volume 893910.1007/978-3-662-46078-8_45(543-554)Online publication date: 24-Jan-2015
https://dl.acm.org/doi/10.1007/978-3-662-46078-8_45
Pillwein VTakacs S(2014)A local Fourier convergence analysis of a multigrid method using symbolic computationJournal of Symbolic Computation10.1016/j.jsc.2013.12.00863(1-20)Online publication date: 1-May-2014
https://dl.acm.org/doi/10.1016/j.jsc.2013.12.008
Sankur OBouyer PMarkey N(2014)Shrinking timed automataInformation and Computation10.1016/j.ic.2014.01.002234(107-132)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1016/j.ic.2014.01.002
Özbudak FPott A(2014)Uniqueness of Fq-quadratic perfect nonlinear maps from Fq 3 to Fq2Finite Fields and Their Applications10.1016/j.ffa.2014.03.00429(49-88)Online publication date: 1-Sep-2014
https://dl.acm.org/doi/10.1016/j.ffa.2014.03.004
Zha ZHu LSun S(2014)Constructing new differentially 4-uniform permutations from the inverse functionFinite Fields and Their Applications10.1016/j.ffa.2013.08.00325(64-78)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1016/j.ffa.2013.08.003
Bedon NRispal C(2012)Schützenberger and Eilenberg theorems for words on linear orderingsJournal of Computer and System Sciences10.1016/j.jcss.2011.06.00378:2(517-536)Online publication date: 1-Mar-2012
https://dl.acm.org/doi/10.1016/j.jcss.2011.06.003
Gauwin ONiehren J(2011)Streamable fragments of forward XPathProceedings of the 16th international conference on Implementation and application of automata10.5555/2032366.2032369(3-15)Online publication date: 13-Jul-2011
https://dl.acm.org/doi/10.5555/2032366.2032369
Okhotin ASalomaa K(2011)Descriptional complexity of unambiguous nested word automataProceedings of the 5th international conference on Language and automata theory and applications10.5555/2022896.2022931(414-426)Online publication date: 26-May-2011
https://dl.acm.org/doi/10.5555/2022896.2022931
Salomaa K(2011)Limitations of lower bound methods for deterministic nested word automataInformation and Computation10.1016/j.ic.2010.11.021209:3(580-589)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.1016/j.ic.2010.11.021
Gauwin ONiehren JTison S(2011)Queries on Xml streams with bounded delay and concurrencyInformation and Computation10.1016/j.ic.2010.08.003209:3(409-442)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.1016/j.ic.2010.08.003
Show More Cited By

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

Exact Learning of Unordered Tree Patterns From Queries

On Exact Learning of Unordered Tree Patterns

Exact learning of tree patterns

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations